Complexity Theory

CAS CS 535

Covers topics of current interest in the theory of computation chosen from computational models, games and hierarchies of problems, abstract complexity theory, informational complexity theory, time-space trade-offs, probabilistic computation, and recent work on particular combinatorial problems.

FALL 2016 Schedule

Section Instructor Location Schedule Notes
A1 Levin PSY 212 TR 3:30 pm-5:00 pm

Note that this information may change at any time. Please visit the Student Link for the most up-to-date course information.