https://act.iti.kit.edu/ 2026-05-09T10:30:32+00:00 https://act.iti.kit.edu/ https://act.iti.kit.edu/_media/wiki/dokuwiki.svg text/html 2024-05-23T12:20:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://act.iti.kit.edu/teaching/24sose/fgcta-seminar?rev=1716466802&do=diff 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. text/html 2024-05-23T11:21:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://act.iti.kit.edu/teaching/24sose/fgcta?rev=1716463310&do=diff Fine-Grained Complexity and Algorithms Competency Goals: Students know the foundations of fundamental algorithmic barriers in the polynomial-time and exponential-time regimes. They are able to use fine-grained reductions to relate the time complexity of different problems. They can derive conditional lower bounds from such reductions, based on established hardness assumptions.