CS 6820

CS 6820

Course information provided by the Courses of Study 2018-2019. Courses of Study 2019-2020 is scheduled to publish mid-June.

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.  Combined with: CS 6820

  • 4 Credits Stdnt Opt

  • 11566CS 6820  LEC 001

    • MWF
    • Kleinberg, R

  • Instruction Mode: Distance Learning-Synchronous

Enrollment Information
Syllabi: none
  •   Regular Academic Session.  Combined with: CS 6820

  • 4 Credits Stdnt Opt

  • 12812CS 6820  LEC 030

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