CS 601A Algorithmic Complexity

CS 601A Algorithmic Complexity

Prof. Rebecca Wright
Lieb 319
Wednesdays 4:30-7:00pm
Spring 2007

Go to: Textbooks | Current Syllabus | Grading

Download homework assignments

HW4 is now available: PS | PDF

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. (Version of 4/23/07)


Assignments are due at the start of class on their due dates. Late assignments will not be accepted. All exceptions must be cleared in advance. There are four homework assignments, one in-class midterm exam, and one in-class final. Class participation also counts towards grading. Your course grade is determined as follows:

Homework Assignments 40% (lowest score dropped)
Midterm Exam 25%
Final Exam 25%
Class Participation 10%

Office Hours

Office hours are by appointment only (send e-mail to Prof. Wright to arrange an appointment).

Last updated 4/23/07 by
rwright (at) cs.stevens.edu
Copyright © 2007 Rebecca N. Wright