CS 6820

CS 6820

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

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 level students.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Opt NoAud

  • 10224 CS 6820   LEC 001

  • Instruction Mode: In Person
    Seats are reserved for graduate students. See enrollment webpage for details: https://www.cs.cornell.edu/courseinfo/enrollment/cs-6000-level-courses

Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Opt NoAud

  • 11191 CS 6820   LEC 030

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