Main content

CS 576 — Computational complexity theory
(dt. Komplexitätstheorie)

Level, degree of commitment Specialization module, depends on importing study program
Forms of teaching and learning,
workload		 Lecture (4 SWS), recitation class (2 SWS),
270 hours (90 h attendance, 180 h private study)
Credit points,
formal requirements		 9 CP
Course requirement(s): Presentation of intermediate results. Attendance is compulsory.
Examination type: Oral examination (individual examination) or written examination
Language,
Grading		 English,
The grading is done with 0 to 15 points according to the examination regulations for the degree program M.Sc. Computer Science.
Subject, Origin Computer Science, M.Sc. Computer Science
Duration,
frequency		 One semester,
irregular
Person in charge of the module's outline Prof. Dr. Christian Komusiewicz

Contents

  • complexity classes, such as LOGSPACE, P, NP, PSPACE
  • Time and space hierarchies
  • Reductions and completeness
  • Determinism / non-determinism and randomization
  • Circuit complexity
  • Parameterized Complexity
  • Fine-Grained Complexity Theory

Qualification Goals

Students will be able to

  • classify problems in terms of their computational difficulty,
  • compare different classes of problems with each other,
  • compare the computational power of different machine models, such as randomized and nondeterministic Turing machines.

Prerequisites

The following module is required: Theoretical Computer Science.


Recommended Reading

  • Sanjeev Arora, Boaz Barak: Computational Complexity - A Modern Approach. Cambridge University Press 2009
  • Christos H. Papadimitriou: Computational complexity. Academic Internet Publ. 2007
  • Ingo Wegener: Complexity theory - exploring the limits of efficient algorithms. Springer 2005
  • Rodney G. Downey, Michael R. Fellows: Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer 2013



Please note:

This page describes a module according to the latest valid module guide in Winter semester 2023/24. Most rules valid for a module are not covered by the examination regulations and can therefore be updated on a semesterly basis. The following versions are available in the online module guide:

  • Winter 2016/17 (no corresponding element)
  • Summer 2018 (no corresponding element)
  • Winter 2018/19 (no corresponding element)
  • Winter 2019/20 (no corresponding element)
  • Winter 2020/21 (no corresponding element)
  • Summer 2021 (no corresponding element)
  • Winter 2021/22 (no corresponding element)
  • Winter 2022/23 (no corresponding element)
  • Winter 2023/24

The module guide contains all modules, independent of the current event offer. Please compare the current course catalogue in Marvin.

The information in this online module guide was created automatically. Legally binding is only the information in the examination regulations (Prüfungsordnung). If you notice any discrepancies or errors, we would be grateful for any advice.