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 |
|---|---|---|---|
|
Leonid Chindelevitch |
Sep 6 – Dec 5, 2016: Tue, 2:30–3:50 p.m.
Sep 6 – Dec 5, 2016: Thu, 2:00–3:20 p.m. |
Burnaby Burnaby |