University of Calgary

CPSC 511 - Introduction To Complexity Theory - Fall 2012

Time and space complexity; the classes P, LOGSPACE, PSPACE and their nondeterministic counterparts; containments and separations between complexity classes; intractability and the theory of NP-completeness; complexity theories for probabilistic algorithms and for parallel algorithms.
This course may not be repeated for credit.


  • H(3-1T)


  • Lectures may run concurrently with Computer Science 611[CPSC611].


  • Computer Science 413.


  • LEC 1MW 14:00 - 15:15
    Peter Hoyer
    TUT 1W 16:00 - 16:50
This course will be offered next in Winter 2014.
Powered by UNITIS. More features.