COMPSCI 3AC3 — Algorithms and Complexity
Basic computability models; the Church-Turing thesis, complexity classes; P versus NP; NP-completeness, reduction techniques; algorithmic design strategies; flows, distributed algorithms, advanced tec
Terms offered: Winter