====== Fine-Grained Complexity and Algorithms Seminar ======
**Content:**

Selected topics from the field of fine-grained complexity theory & algorithm design. This consists of recent papers on fine-grained hardness assumptions, conditional lower bounds and algorithmic results for important problems from various sub-areas.


Each student will present a topic and summarize it in a scientific report.

**Workload**

4 CP amounts to 120 h, distributed as follows:

  * about 10 h attendance in class
  * about 40 h literature search and review
  * about 40 h preparation of presentation
  * about 30 h writing of scientific report

 

**Competency certificate:**

The assessment is carried out as an examination of another type (§ 4 Abs. 2 No. 3 SPO) and consists of a presentation and a scientific report.

**Recommendations:**

Basic knowledge of theoretical computer science and algorithm design is recommended.

Concurrent or previous attendance of the lecture “Fine-Grained Complexity Theory & Algorithms” is helpful, but not required. This seminar can be attended independently.


----
[[https://ilias.studium.kit.edu/goto.php?target=crs_2373715&client_id=produktiv|ILIAS Course]]
[[https://campus.studium.kit.edu/ev/bLWzwh4EQ3a_NTvylz5zyg/de|Module Handbook]]