CSC 364S (Evening Section): Computational Complexity and Computability
Winter, 2003

Announcements

Course Information Sheet

Lectures: W 7-9 BA 1190

Tutorials: W6
Your tutorial is determined by the first letter of your last name:
A-H: BA 1190 Pablo Barcelo
I-R: BA 3012 Philipp Hertel NOTE ROOM CHANGE
S-Z: BA 3008 Pixing Zhang

Instructor: Stephen Cook , email: sacook@cs, Office: Sandford Fleming 2303C, 416-978-5183
Office Hours: M 3-4, W 4:30-5:30. Or make an appointment, or drop in, or send a question via email.

TA Office Hours: The intention is to schedule these before assignments are due and before tests. Specifically:

Thursday, April 17, 4-5pm in SF 3207.

Text: No required text. See lecture notes below.

References:

Cormen, Leiserson, Rivest, and Stein: Introduction to Algorithms (Second Edition), MIT Press and McGraw-Hill. The most relevant chapters for this course are 3, 15, 16, 25, 26, and 34.

M. Garey and D. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. Chapters 1-3 especially relevant.

M. Sipser: Introduction to the Theory of Computation. Chapters 3,4,5. (This material is not covered in Cormen et al.)

CURRENT LECTURE NOTES
CURRENT PROBLEM SETS

CURRENT TESTS