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 |
May 9 – Aug 8, 2016: Mon, Wed, Fri, 3:30–4:20 p.m.
|
Burnaby |