====== Fine-Grained Complexity 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 and Algorithm Design” is helpful, but not required. This seminar can be attended independently. * Registration: **Send an email to: [[mirza.redzic@kit.edu]]** [[https://campus.studium.kit.edu/events/catalog.php#!campus/all/event.asp?gguid=0x25727DCB55AF45CA946E389928A624CD&camvguid=0xEC5E6F483D6C4796833D9C94E87ED4B9&cafiguid=|Module Handbook]]