CS 6820

CS 6820

Course information provided by the Courses of Study 2018-2019.

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 Stdnt Opt

  • 11771CS 6820  LEC 001

  • Enrollment for this course is limited to PhD/MS only. All others may only register with instructor approval.

Enrollment Information
Syllabi: none
  •   Regular Academic Session. 

  • 4 Credits Stdnt Opt

  • 17776CS 6820  LEC 030

  • Instruction Mode: Distance Learning - WWW
    Taught in NYC. Enrollment limited to Cornell Tech PhD students. Offered via Distance Learning, streaming from Ithaca.