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 |
|---|---|---|---|
|
Valentine Kabanets |
Jan 3 – Apr 8, 2019: Mon, Fri, 2:30–3:20 p.m.
Jan 3 – Apr 8, 2019: Wed, 2:30–3:20 p.m. |
Burnaby Burnaby |