- Schedule of Classes - February 6, 2017 7:14PM EST
- Course Catalog - February 6, 2017 7:15PM EST
Course information provided by the Courses of Study 2016-2017.
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
Disabled for this roster.