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 |
|---|---|---|---|
|
Joseph Peters |
Sep 8 鈥� Dec 7, 2015: Mon, 12:30鈥�1:20 p.m.
Sep 8 鈥� Dec 7, 2015: Wed, Fri, 12:30鈥�1:20 p.m. |
Burnaby Burnaby |