CS 6820

CS 6820

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.


Prerequisites REF-FA25/Corequisites REF-FA25 CS 4820 or graduate level students. Corequisites: None.

Last 4 terms offered (None)

View Enrollment Information

Syllabi: none
  •   Regular Academic Session.  Choose one lecture and one project.

  • 4 Credits Opt NoAud

  •  4684 CS 6820   LEC 001

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

  • Instruction Mode: In Person

    Enrollment limited to: Ithaca campus graduate students. Undergraduate and Master of Engineering (M.Eng.) students must add themselves to the waitlist during add/drop.
    For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/

  •  7132 CS 6820   PRJ 601

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

  • Instruction Mode: In Person