CS 6820
Last Updated
- Schedule of Classes - January 9, 2020 9:13AM EST
- Course Catalog - January 9, 2020 9:14AM EST
Classes
CS 6820
Course Description
Course information provided by the Courses of Study 2019-2020.
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. Combined with: CS 6820
-
Credits and Grading Basis
4 Credits Stdnt Opt(Letter or S/U grades)
-
Class Number & Section Details
-
Meeting Pattern
- MWF Bill and Melinda Gates Hll G01
Instructors
Kleinberg, R
Regular Academic Session. Combined with: CS 6820
-
Credits and Grading Basis
4 Credits Stdnt Opt(Letter or S/U grades)
-
Class Number & Section Details
-
Meeting Pattern
-
MW
Bloomberg Center 397
Cornell Tech Instructors
Kleinberg, R
-
F
Bloomberg Center 397
Cornell Tech Instructors
Kleinberg, R
-
MW
Bloomberg Center 397
-
Additional Information
Instruction Mode: Distance Learning-Synchronous
Taught in NYC. Enrollment limited to Cornell Tech PhD students. Class will be streamed from Ithaca.
Share
Disabled for this roster.