Skip to main content

Computational Complexity:  2008-2009

Lecturer

Degrees

Schedule B2Computer Science

Schedule B2Mathematics and Computer Science

Schedule BMSc in Computer Science

MSc by Research

Term

Overview

This course is an introduction to the theory of computational complexity and standard complexity classes. One of the most important insights to have emerged from Theoretical Computer Science is that computational problems can be classified according to how difficult they are to solve. This classification has shown that many computational problems are impossible to solve, and many more are impractical to solve in a reasonable amount of time. To classify problems in this way, one needs a rigorous model of computation, and a means of comparing problems of different kinds. This course introduces these ideas, and shows how they can be used.

Learning outcomes

The course is designed to enable students to:

  1. State precisely what it means for a problem to be computable, and show that some problems are not computable.
  2. State precisely what it means to reduce one problem to another, and construct reductions for simple examples.
  3. Classify problems into appropriate complexity classes, including P, NP and PSPACE, and use this information effectively.

Synopsis

  1. [2 lectures] Turing machine and elements of computability. Models of computation. Multitape deterministic Turing machines. Decision problems.
  2. [3 lectures] Polynomial time. DTIME[t]. Linear Speed-up Theorem. P. Polynomial reducibility. Polytime algorithms: 2-satisfiability, 2-colourability.
  3. [5 lectures] NP and NP-completeness. Non-deterministic Turing machines. NTIME[t]. NP. Polynomial time verification. NP-completeness. Cook-Levin Theorem. Polynomial transformations: 3-satisfiability, clique, colourability, Hamilton cycle, partition problems. Pseudo-polynomial time. Strong NP-completeness. Knapsack. NP-hardness.
  4. [2 lectures] Space complexity. DSPACE[s]. Linear Space Compression Theorem. PSPACE, NPSPACE. PSPACE = NPSPACE. PSPACE-completeness. Quantified Boolean Formula problem is PSPACE-complete. L, NL and NL-completeness. NL=coNL.
  5. [2 lectures] Optimization and approximation. Combinatorial optimisation problems. Relative error. Bin-packing problem. Polynomial and fully polynomial approximation schemes. Vertex cover, travelling salesman problem, minimum partition.
  6. [2 lectures] Other topics. Randomized Complexity. The classes BPP, RP, ZPP. Interactive proof systems: IP = PSPACE.

Syllabus

Turing machines, computability, decision problems, undecidability, time complexity, polynomial time algorithms, NP and NP-completeness, standard time and space complexity classes, optimization problems and approximation algorithms.

Reading list

Primary Text
  • M Sipser, Introduction to the Theory of Computation, (First edition - PWS Publishing Company, January 1997, or second edition - Thomson Course Technology, 2005).
Supplementary List
  • I Wegener, Complexity Theory, Springer, 2005.
  • C H Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
  • S Arora and B Barak, Computational Complexity: A Modern Approach, preliminary version available online at princeton
  • M R Garey and D S Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.
  • T H Cormen, S Clifford, C E Leiserson and R L Rivest, Introduction to Algorithms, MIT Press, Second edition, 2001.
  • Oded Goldreich, Computational Complexity, Cambridge University press.