CS 579
Fall 2024 Part of Term 1
Aug 26-Dec 11
Credit: 4 hours.
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.
Same as ECE 579. 4 graduate hours. No professional credit. Prerequisite: One of CS 473, CSE 414, MATH 473, CS 475 or MATH 475.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
51780
|
Lecture-Discussion
|
F
|
3:30PM
-4:45PM
|
TR
|
Siebel Center for Comp Sci
|
Forbes, M
|
|