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.
The (revised) syllabus for this course is available here.
Office hours are Thursdays 2-4pm, by appointment only.
Last updated 2/12/03 by
rwright (at) cs.stevens-tech.edu