CS 6820

CS 6820

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 for undergraduates: CS 4820.

Enrollment Information Enrollment limited to: Computer Science graduate and professional students.

Last 4 Terms Offered 2025FA, 2024FA, 2023FA, 2022FA

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  •  6773 CS 6820   LEC 001

    • MWF
    • Jan 25 - May 11, 2027
    • Kleinberg, R

  • Instruction Mode: In Person

    For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/

Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 17618 CS 6820   LEC 030

    • MWF
    • Kleinberg, R

  • Instruction Mode: Distance Learning-Synchronous

    Enrollment limited to: Cornell Tech Doctor of Philosophy (PhD) students.