- Schedule of Classes - January 7, 2018 7:14PM EST
- Course Catalog - January 7, 2018 7:15PM EST
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.
Credits and Grading Basis
4 Credits Stdnt Opt(Letter or S/U grades)
Class Number & Section Details
- MWFBill and Melinda Gates Hll G01
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.
Or send this URL: