University Homepage School Homepage School Contacts School Search

Computational Complexity (INF-4-CMC)

This course is offered in the second semester, on Mondays and Thursdays at 15:00. For the 2011-12 year, lectures are in the Robson Building Lecture Theatre. The course is taught by Rahul Santhanam. The lecturer holds office hours every Wednesday from 3-5 pm in IF 5.20. Note that the first lecture for the 2011 instalment will be on Thursday, 19 January.

• Learning resources
  • Revision Guide
  • Course Notes
    • Lecture Notes Part 1.
    • Lecture Notes Part 2.
    • Lecture Notes Part 3.
    • Lecture Notes Part 4
    • Lecture Notes Part 5
    • Lecture Notes Part 6
    • Supplementary Note 1: Proof of the Hennie-Stearns theorem.
    • Supplementary Note 2: Proof of the Immerman-Szelepcsenyi theorem
  • Old Course Notes
    • Chapter 1. Turing machines and complexity classes.
    • Chapter 2. Natural classes and completeness.
    • Chapter 3. Circuits and parallel computation.
    • Chapter 4. An introduction to randomised computation.
    • Chapter 5. Provably intractable problems.
  • The world's original and first Complexity Blog (Lance Fortnow).

• Coursework
  • Exercise Sheet 1 (due February 17) ( Solutions )
  • Exercise Sheet 2 ( Solutions )
  • Exercise Sheet 3 ( Solutions )

• Feedback: please fill in a questionnaire!

• Past Examination Papers
  • April 1996
  • April 1997
  • May 1998
  • April 1999
  • May 2000
  • April 2001
  • April 2002 (with solutions to Q1, Q2 and Q3).
  • April 2003 (with solutions to Q1, Q2 and Q3).
  • April 2004 (or with solutions).
  • May 2005 (and solutions).