På Svenska

DD2446 Complexity Theory 6.0 credits

Komplexitetsteori

Advanced course in computer science focusing on modern complexity theory.

  • Educational level

    Second cycle

  • Academic level (A-D)

    D

  • Subject area

    Information Technology

  • Grade scale

    A, B, C, D, E, FX, F

Course offerings

Autumn 13 kplx13 for programme students

Learning outcomes

After a completed course, the student should be able to

  • define basic complexity classes such as P, NP, PSPACE, L, NL and NC,
  • formulate complete problems for each complexity class and show problems complete by reductions,
  • prove basic theorems about complexity measures and be able to reason about complexity theoretic concepts,
  • read research articles within complexity theory to the extent of understanding the main contribution of the paper.

Course main content

The fundamental goal of complexity theory is to classify problems according to the amount of resources needed to solve them. Complexity classes are classes of problems that in some respect demand the “same” amount of resources. The most basic resources studied are time and space. A complete problem for a complexity class is a problem that can be viewed as the hardest problem in the class.

Among the topics treated in the course are: Complexity classes: L, NL, P, NP, PSPACE, etc, Reductions and completeness, Cooks' theorem. Approximability, Randomized algorithms and Interactive proofs (IP).

Eligibility

Prerequisites

One of the courses 2D1352/DD1352 Algorithms, Data Structures, and Complexity or 2D1354/DD2354 Algorithms and Complexity or the equivalent.

Literature

To be announced at least 4 weeks before course start at course web page. 07/08: S. Arora and B. Barak Computational Complexity: A Modern Approach, Cambridge University Press.

Examination

  • ÖVN1 - Hand in Task, 6.0 credits, grade scale: A, B, C, D, E, FX, F

In this course all the regulations of the code of honor at the School of Computer science and Communication apply, see: http://www.kth.se/csc/student/hederskodex/1.17237?l=en_UK.

Requirements for final grade

Written exercises (ÖVN1; 6 university credits).

Offered by

CSC/Computer Science

Contact

Jakob Nordström, http://www.csc.kth.se/~jakobn/

Examiner

Jakob Nordström

Supplementary information

The course is given in English unless all course participants understand Swedish.

The course is given every second year.

Add-on studies

Please discuss with the instructor.

Version

Course plan valid from: Autumn 09.
Examination information valid from: Autumn 07.