CS 6820
Last Updated
- Schedule of Classes - February 16, 2018 10:59AM EST
- Course Catalog - February 12, 2018 11:18AM EST
Classes
CS 6820
Course Description
Course information provided by the Courses of Study 2017-2018.
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
Pre-enrollment in this class is limited to CIS students only. All others should add themselves to the waitlist via Student Center during the Add/Drop Period. Please see http://www.cs.cornell.edu/courseinfo/enrollment for more information.
Share
Or send this URL: