Please note:
To view the Fall 2025 Academic Calendar, go to www.sfu.ca/students/calendar/2025/fall.html.
Computational Complexity CMPT 710 (3)
This course provides a broad view of theoretical computing science with an emphasis on complexity theory. Topics will include a review of formal models of computation, language classes, and basic complexity theory; design and analysis of efficient algorithms; survey of structural complexity including complexity hierarchies, NP-completeness, and oracles; approximation techniques for discrete problems. Students with credit for CMPT 810 may not take this course for further credit.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Valentine Kabanets |
Jan 5 – Apr 10, 2026: Tue, 2:30–4:20 p.m.
Jan 5 – Apr 10, 2026: Thu, 2:30–3:20 p.m. |
Burnaby Burnaby |