Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Computational ComplexityModule description #40379 / Version 5

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27). Current version (v9)
Module / Version#40379 / #5
ValiditySS 2016 – WS 2016/17
Available language(s)English
Credit points9
Person responsible for the moduleNiedermeier, Rolf
GradingGraded
Exam formatOral exam
Language(s) of instructionEnglish

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34351100 FG Algorithmik und Komplexitätstheorie (AKT)

Contact

OfficeEN 23
Contact personThielcke, Christlinde
E-mail addresslehre@akt.tu-berlin.de
Websitehttps://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen

Learning outcomes

On successful completion, students will be able to:
- estimate the computational costs for solving fundamental problems
- classify discrete computational problems according to their computational complexity using reductions and standard complexity classes
- understand structural properties of complexity classes
- make qualitative and quantitative statements about computational complexity questions

Content

Introduction into structural complexity theory, with particular emphasis on complexity resources time and space.
Particular topics are:

- complexity classes
- reductions between problems
- theory of the NP-completeness and the P vs. NP question
- hierarchy theorems and polynomial time hierarchy
- interactive proof systems

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Computational ComplexityLecture0434 L 233 Summer semester–4 ISIS
Computational ComplexityExercise0434 L 233 Summer semester–2 ISIS

Workload and credit points

Computational Complexity (Lecture)

Workload descriptionMultiplierHoursTotal
Präsenzzeit154 h60 h
Vor-/Nachbereitung155 h75 h
135 h

Computational Complexity (Exercise)

Workload descriptionMultiplierHoursTotal
Präsenzzeit152 h30 h
Vor-/Nachbereitung155 h75 h
105 h

Course-independent workload

Workload descriptionMultiplierHoursTotal
Prüfungsvorbereitung130 h30 h
30 h

The workload of the module adds up to 270 hours. The module therefore comprises 9 credit points.

Description of teaching and learning methods

There is a lecture 4 hours per week presenting the whole course material. The lectures are accompanied by tutorials in which distributed work sheets are solved together.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

a) obligatory: Basic course on automata and complexity
b) desirable: Basic knowledge on algorithms

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

GradingGraded
Exam formatOral exam
LanguageEnglish

Exam description

Final oral exam determining the grade (MP).

Duration of the module

The following number of semesters is estimated for taking and completing the module: 1 semester(s).

This module can be started in the following semesters: Summer semester.

Maximum number of participants

This module is not limited to a number of students.

Registration procedures

Please register at QISPOS or directly at the examination office.

Recommended reading, lecture notes

Lecture notes

unavailable

Electronic lecture notes

unavailable

Recommended literature

  • Christos H. Papadimitriou: Computational Complexity, Addison Wesley, 1994.
  • Sanjeev Arora, Boaz Barak: Computational Complexity: A Modern Approach, Cambridge University Press, 2009

Assigned programs

This module is not used in any program.

Computer Science Master with focus “Reliable Systems”
Computer Science diploma
Technical Computer Science Master with focus “Software Engineering”
Technical Computer Science diploma

Miscellaneous

Not specified