CS 601A Algorithmic Complexity

CS 601A Algorithmic Complexity

Prof. Rebecca Wright
Lieb 319
Tuesdays 6:15-8:45pm
Spring 2004


Course description

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, Addison-Wesley.
Michael Garey and David Johnson, Computers and Intractability, W. H. Freeman and Company.


Syllabus for this course: PS | PDF .

Office Hours

Office hours are Thursdays 2-4pm, by appointment only.

Last updated 4/13/04 by
rwright (at) cs.stevens-tech.edu
Copyright © 2004 Rebecca N. Wright