i Please note:
To view the current calendar, go to
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. Equivalent Courses: CMPT810.
For calendar technical problems or errors, contact calendar-sfu@sfu.ca | Calendar Changes and Corrections