CS 6820
Last Updated
- Schedule of Classes - January 14, 2015 6:16PM EST
- Course Catalog - January 14, 2015 6:21PM EST
Classes
CS 6820
Course Description
Course information provided by the Courses of Study 2014-2015.
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(Student Option)
-
Class Number & Section Details
-
Meeting Pattern
- MWF Hollister Hall 110
Instructors
Tardos, E
-
Additional Information
Instruction Mode:
Share
Disabled for this roster.