Design and Analysis of Computing Algorithms CMPT 405 (3)
Models of computation, methods of algorithm design; complexity of algorithms; algorithms on graphs, NP-completeness, approximation algorithms, selected topics. Prerequisite: CMPT 307.
| Section | Instructor | Day/Time | Location |
|---|---|---|---|
|
Andrei Bulatov |
Jan 4 – Apr 7, 2017: Tue, 11:30 a.m.–1:20 p.m.
Jan 4 – Apr 7, 2017: Thu, 11:30 a.m.–12:20 p.m. |
Burnaby Burnaby |