CS 6820
Last Updated
- Schedule of Classes - March 17, 2025 8:55AM EDT
Classes
CS 6820
Course Description
Course information provided by the 2025-2026 Catalog.
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.
Prerequisites REF-FA25/Corequisites REF-FA25 CS 4820 or graduate level students. Corequisites: None.
Last 4 terms offered (None)
Regular Academic Session. Choose one lecture and one project.
-
Credits and Grading Basis
4 Credits Opt NoAud(Letter or S/U grades (no audit))
-
Class Number & Section Details
-
Meeting Pattern
- MWF
- Aug 25 - Dec 8, 2025
Instructors
Kleinberg, R
-
Additional Information
Instruction Mode: In Person
Enrollment limited to: Ithaca campus graduate students. Undergraduate and Master of Engineering (M.Eng.) students must add themselves to the waitlist during add/drop.
For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/
Share
Disabled for this roster.