Course Websites
CS 579 - Computational Complexity
Last offered Fall 2021
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. Prerequisite: CS 473 or CS 475.
Related Faculty
| Title | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|
| Computational Complexity | F | 51780 | ONL | 4 | 1400 - 1515 | T R | Michael A Forbes |