CS 601 Algorithmic Complexity

Analysis of algorithms: resource-bounded computation and time and space complexity. Various models of computation will be studied. Complexity classes and reducibilities, hardness, and completeness. Randomized algorithms and approximation algorithms.

Credits

3

Prerequisite

CS 600 or (CS 334 and CS 385)