|
May 01, 2024
|
|
|
|
COMPSCI 3AC3 - Algorithms and Complexity 3 unit(s)
Basic computability models; the Church-Turing thesis, complexity classes; P versus NP; NP-completeness, reduction techniques; algorithmic design strategies; flows, distributed algorithms, advanced techniques such as randomization.
Three lectures, one tutorial (one hour), second term
Prerequisite(s): COMPSCI 2C03 or SFWRENG 2C03 , COMPSCI 2AC3 or 2FA3 or SFWRENG 2FA3
Add to Favourites (opens a new window)
|
|