CSCI-B 502 COMPUTATIONAL COMPLEXITY (3 CR.)
Study of computational complexity classes, their intrinsic properties, and relations between them. Topics include time and space computational complexity, reducibility and completeness of problems within complexity classes, complexity of optimization problems, complexity hierarchies, relativization of the P=?NP conjecture, and parallel computation models and the class NC.
1 classes found
Fall 2024
| Component | Credits | Class | Status | Time | Day | Facility | Instructor |
|---|---|---|---|---|---|---|---|
| LEC | 3 | 36822 | Open | 3:00 p.m.–4:15 p.m. | MW | M2 100 | LaRacuente N |
Regular Academic Session / In Person
LEC 36822: Total Seats: 25 / Available: 14 / Waitlisted: 0
Lecture (LEC)