CS 6820
Last Updated
- Schedule of Classes - March 3, 2021 7:15PM EST
- Course Catalog - March 3, 2021 7:16PM EST
Classes
CS 6820
Course Description
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.
Regular Academic Session.
-
Credits and Grading Basis
4 Credits Opt NoAud(Letter or S/U grades (no audit))
-
Class Number & Section Details
-
Meeting Pattern
- MW Online Meeting
- Sep 2 - Dec 16, 2020
Instructors
Kleinberg, R
-
Additional Information
Instruction Mode: Online
Enrollment is restricted to grad students only. Undergraduates will need to add themselves to the waitlist during add/drop.
Regular Academic Session.
-
Credits and Grading Basis
4 Credits Opt NoAud(Letter or S/U grades (no audit))
-
Class Number & Section Details
-
Meeting Pattern
-
MW
Online Meeting
Cornell Tech - Sep 2 - Dec 16, 2020
Instructors
Kleinberg, R
-
MW
Online Meeting
-
Additional Information
Instruction Mode: Online
Taught in NYC at Cornell Tech. Enrollment limited to Cornell Tech PhD students. Class will be streamed from Ithaca.
Share
Disabled for this roster.