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 |
|---|---|---|---|
|
Petra Berenbrink |
Jan 5 – Apr 11, 2016: Mon, Wed, 10:30–11:20 a.m.
Jan 5 – Apr 11, 2016: Fri, 10:30–11:20 a.m. |
Burnaby Burnaby |