CS 5820

CS 5820

Course information provided by the 2025-2026 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.


Last 3 terms offered 2025SP, 2024FA, 2024SP

View Enrollment Information

Syllabi: none
  •   Regular Academic Session.  Choose one lecture and one project. Combined with: CS 6820

  • 4 Credits Stdnt Opt

  •  5118 CS 5820   LEC 001

    • MWF
    • Aug 25 - Dec 8, 2025
    • 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/

  •  7151 CS 5820   PRJ 601

    • TBA
    • Aug 25 - Dec 8, 2025
    • Kleinberg, R

  • Instruction Mode: In Person