Course Websites

CS 579 - Computational Complexity

Last offered Fall 2024

Official Description

Turing machines; determinism and non-determinism; time and space hierarchy theorems; speed-up and tape compression; Blum axioms; structure of complexity classes NP, P, NL, L, and PSPACE; complete problems; randomness and complexity classes RP, RL, and BPP; alternation, polynomial-time hierarchy; circuit complexity, parallel complexity, NC, and RNC; relativized computational complexity; time-space trade-offs. Course Information: Same as ECE 579. 4 graduate hours. No professional credit. Prerequisite: One of CS 473, CSE 414, MATH 473, CS 475 or MATH 475.

Related Faculty

Computational ComplexityF51780LCD41530 - 1645 T R  1302 Siebel Center for Comp Sci Michael A. Forbes