CS 5820

Last Updated

  • Schedule of Classes - March 20, 2026 3:39PM EDT

CS 5820
Analysis of Algorithms

Course information provided by the 2026-2027 Catalog.

Methodology for developing and analyzing efficient algorithms. Understanding the inherent complexity of natural problems via polynomial-time algorithms, advanced data structures, randomized algorithms, approximation algorithms, and NP-completeness. Additional topics may include algebraic and number theoretic algorithms, circuit lower bounds, online algorithms, or algorithmic game theory.


Prerequisites CS 4820 or graduate level students.

Last 4 Terms Offered 2026SP, 2025FA, 2025SP, 2024FA

View Enrollment Information

Syllabi: none

  •   Regular Academic Session.  Combined with: CS 6820

  • 4 Credits Stdnt Opt

  •  7275 CS 5820   LEC 001

  •  
    • MWF
    • Aug 24 - Dec 7, 2026

    • Kleinberg, R

  • Instruction Mode: In Person

    Direct enrollment is restricted to Computer Science (CS), Doctor of Philosophy (PhD), Master of Science (MS), and Master of Engineering (M.Eng.) students. Seniors taking courses for M.Eng credit and all other graduate and professional students must add themselves to the waitlist during add/drop. See website for details: http://www.cs.cornell.edu/courseinfo/enrollment/cs-4000-5000-level-courses
    For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/