CS 6820
Last Updated
- Schedule of Classes - October 15, 2026 7:07PM EDT
Classes
CS 6820
Course Description
Course information provided by the 2026-2027 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 for undergraduates: CS 4820.
Enrollment Information Enrollment limited to: Computer Science graduate and professional students.
Last 4 Terms Offered 2025FA, 2024FA, 2023FA, 2022FA
Regular Academic Session.
-
Credits and Grading Basis
4 Credits Stdnt Opt(Letter or S/U grades)
-
Class Number & Section Details
-
Meeting Pattern
- MWF
- Jan 25 - May 11, 2027
Instructors
Kleinberg, R
-
Additional Information
Instruction Mode: In Person
For Bowers Computer and Information Science (CIS) Course Enrollment Help, please see: https://tdx.cornell.edu/TDClient/193/Portal/Home/
Regular Academic Session.
-
Credits and Grading Basis
4 Credits Stdnt Opt(Letter or S/U grades)
Share
Or send this URL:
