-
Course Details
Lecturer: Prof. Dr. Heribert Vollmer
Frequency: Every two years (even years) in the winter semester
Course type: Lecture, exercise, and seminar (2V + 1Ü + 2S, 7 ECTS)
Examination: Oral exam
-
Course Contents
The course provides in-depth knowledge of concepts, techniques, and phenomena in parameterized complexity theory. Upon successful completion, students will be able to analyze algorithmic problems in terms of their parameterized complexity. They will assess how computational complexity depends on structural properties of input instances and develop classifications of problem difficulty based on input parameters.
Outline:
- The class FPT
- Reductions
- The W-hierarchy
- Logic and complexity
- Paradigms of algorithm design
-
Information about exam
The final examination of the module is an oral exam.
Schedule
The exam dates are assigned via an internal institute website (see link below). Note: This does not replace registration for the exam in QIS.
Registration
Depending on your examination regulations, registration in QIS may be required (see link below).
Coursework Requirement
If your examination regulations require coursework for this module, please contact the lecturer.
Parameterized Complexity Theory
Last Change: 21.05.25
