Note: This is the 2011鈥�2012 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click聽here to jump to the newest eCalendar.
Overview
Computer Science (Sci) : The study of computational complexity and intractability: Cook's Theorem, NP-completeness, oracles, the polynomial hierarchy, lower bounds, heuristics, approximation problems.
Terms: This course is not scheduled for the 2011-2012 academic year.
Instructors: There are no professors associated with this course for the 2011-2012 academic year.