Analysis of algorithms: resource bounded computation, time and space
complexity. Various models of computation will be studied. Complexity
classes and reducibilities, hardness and completeness. Randomized
algorithms and approximation algorithms.
Prerequisites: CS 600.
Christos Papadimitriou, Computational Complexity,
Michael Garey and David Johnson, Computers and Intractability,
W. H. Freeman and Company.