CSC2401 Home Page (Fall 2001)
This page provides WWW access to various documents concerning csc2401.
Many of these documents are electronic versions of
handouts given in class. Announcements will also be made on
this page.
Please send any comments or questions to the instructor:
This course is a standard graduate level introduction
to complexity.
The text is ``Theory of Computational Complexity'' by Ding-Zhu Du and Ker-I KO.
We will follow previous versions of this course and, in
particular, the course will be quite similar to the version taught last year.
The survey article Time-Space Lower Bounds for Satisfiability by
Dieter van Melkebeek
can be
found on his home page
. The
complexity course notes by Martin Tompa (based on Alternating Turing machines) can be viewed here.
Lecture Notes
Assignments