Introduction to Complexity Theory
CS 28100

Course Information - Textbooks - Homework

Announcements

The MIDTERM PROJECT is now posted. It is due Friday, May 5th, at the beginning of class.

Course Information

Class: MWF 11:30-12:30 Ryerson 251
Tutorial: M 5:00 Ryerson 255

Homework will be assigned every Wednesday and is due the following Wednesday in class.

Grading is as follows:
30% Homework
30% Midterm
40% Final

Instructor
Ketan Mulmuley
Ryerson 165B
Email:  mulmuley at cs dot uchicago
Office Hours: M 1:30-2:30

TA
Duru Turkoglu
Ryerson 257
Email:  duru at cs dot uchicago
Office Hours: WF 2:30-4

TA
Eric Purdy
Ryerson 165A
Email:  epurdy at cs dot uchicago
Office Hours: TuTh 3-4:30

Textbooks
Required
Computability and Complexity Theory, by Homer and Selman.
Available at the Seminary Coop or Amazon.
Recommended
Introduction to Automata Theory, Languages, and Computation, by Hopcroft, Motwani & Ullman
Available on Amazon, and on reserve in the library.