CS 579
CS 579 - Computational Complexity
Spring 2020
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Computational Complexity | CS579 | F | 41446 | LCD | 4 | 1530 - 1645 | T R | 1109 Siebel Center for Comp Sci | Michael A Forbes |
| Computational Complexity | ECE579 | F | 41445 | LCD | 4 | 1530 - 1645 | T R | 1109 Siebel Center for Comp Sci | Michael A Forbes |
See full schedule from Course Explorer
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.