CS 579 F - Computational Complexity
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. Prerequisite: CS 473 or CS 475.
For up-to-date information about CS course restrictions, please see the following link: http://go.cs.illinois.edu/csregister
Academic Program Restrictions:
MCS:Computer Sci Online -UIUC
Option 1Number of Required Visit(s): 0
Course Level: Graduate