ECE 579
Spring 2005 All Classes
All Classes
Credit: 4 hours.
(ECE 479) 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, PSPACE; complete problems; randomness and complexity classes RP, RL, BPP; alternation, polynomial-time hierarchy; circuit complexity, parallel complexity, NC, RNC; relativized computational complexity; time-space trade-offs.
Same as CS 579 and MATH 578. Prerequisite: CS 473 or CS 475 or consent of instructor
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
41445
|
Lecture-Discussion
|
F
|
1:00PM
-1:50PM
|
MWF
|
169 Everitt Laboratory
|
Roman, M
|
|