CS 6820

CS 6820

Course information provided by the Courses of Study 2020-2021.

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.

When Offered Fall.

Prerequisites/Corequisites Prerequisite: CS 4820 or graduate standing.

View Enrollment Information

Enrollment Information
Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Opt NoAud

  • 20097CS 6820  LEC 002

    • MWOnline Meeting
    • Sep 2 - Dec 16, 2020
    • Kleinberg, R

  • Instruction Mode: Online
    Enrollment is restricted to grad students only. Undergraduates will need to add themselves to the waitlist during add/drop.

Enrollment Information
Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Opt NoAud

  • 11444CS 6820  LEC 030

  • Instruction Mode: Online
    Taught in NYC at Cornell Tech. Enrollment limited to Cornell Tech PhD students. Class will be streamed from Ithaca.