WClasses
CS 664 - Computational Complexity Theory
The classification of problems according to the computational resources required for their solution, with emphasis on properties of feasible computations rather than on specific algorithms. Topics include: time and space complexity, tractable and intractable problems, computation using randomness, parallel computation.
Prerequisites
Corequisites
None
Antirequisites
None
Offerings
Winter 2002 [1021]
| Section | Class | Enrolled | Time | Days | Location | Instructor |
|---|---|---|---|---|---|---|
| LEC 001 | 4205 | 5 / 20 | 09:30 - 10:20 | M,W,F,R,C,H | Troy Vasiga |