CS 579
Spring 2007 Part of Term 1
Part of Term 1
Jan 16-May 2
Jan 16-May 2
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 and MATH 578. Prerequisite: CS 473 or CS 475.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
41446
|
Lecture-Discussion
|
F
|
11:00AM
-12:15PM
|
TR
|
Siebel Center for Comp Sci
|
Prabhakaran, M
|
|