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