CS 601A Algorithmic Complexity

CS 601A Algorithmic Complexity

Prof. Rebecca Wright
Peirce 120
Tuesdays 6:15-8:45pm
Fall 2005

Homework 4

You can now download HW4 in Postscript or PDF form.

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 1-3pm, by appointment only.

Last updated 11/16/05 by
rwright (at) cs.stevens.edu
Copyright © 2005 Rebecca N. Wright