Instructor

Craig A. Rich
Office: Bldg. 8, Room 40
Office Hours: Mon, Fri 10:00-11:30; Wed 9:30-11:30
Phone: (909) 869-3447
Electronic Mail: carich@csupomona.edu

Time: Tue, Thu 4:00-5:50
Place: Bldg. 8, Room 345

Rich, Craig A. Computability and Complexity Theory--CS 531 Lecture Notes, Winter 2000 (Available at Bronco Copy 'n Mail in the University Union).

Garey, Michael R.; and Johnson, David S. Computers and Intractability--A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., New York, 1979 (Available at Cal Poly Bronco Bookstore or Campus Books).

my home page:		http://www.csupomona.edu/~carich/
CS 531 home page:		http://www.csupomona.edu/~carich/classes/cs531/

Exams			70%
Midterm (Thursday, February 3)		35%
Final (Tuesday, March 14, 3:50-5:50 p.m.)		35%
Homework and Quizzes			30%

Graded assignments will be accepted without penalty at any time on or before their due date. Graded assignments which are submitted after their due date will have their score reduced by 5(n+1)%, where n is the number of school days properly between the due date and the date submitted.

The course will cover most of the topics in chapters 1-4 and 7 of the textbook.