CS 6820
Last Updated
- Schedule of Classes - January 31, 2019 7:14PM EST
- Course Catalog - January 31, 2019 7:15PM EST
Classes
CS 6820
Course Description
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.
Regular Academic Session.
-
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
-
Additional Information
Enrollment for this course is limited to PhD/MS only. All others may only register with instructor approval.
Regular Academic Session.
-
Credits and Grading Basis
4 Credits Stdnt Opt(Letter or S/U grades)
-
Class Number & Section Details
-
Meeting Pattern
-
MW
Bloomberg Center B61
Cornell Tech Instructors
Kleinberg, R
-
F
Bloomberg Center B91
Cornell Tech Instructors
Kleinberg, R
-
MW
Bloomberg Center B61
-
Additional Information
Instruction Mode: Distance Learning - WWW
Taught in NYC. Enrollment limited to Cornell Tech PhD students. Offered via Distance Learning, streaming from Ithaca.
Share
Disabled for this roster.