CS 601A Algorithmic Complexity

CS 601A Algorithmic Complexity

Prof. Rebecca Wright
Morton 103
Tuesdays 6:15-8:45pm
Spring 2003

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.


The (revised) syllabus for this course is available here.

Office Hours

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

Last updated 2/12/03 by
rwright (at) cs.stevens-tech.edu
Copyright © 2003 Rebecca N. Wright