Csus/resource/course/cpsc 511

CPSC 511

Introduction to Complexity Theory Description 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. Course Notes Previous Course Materials Previous Tutorial Materials Programming Languages External Links