How can tasks be solved with few resources, and where is the limit of efficient solvability? The overall goal of the research in this area is to gain a deep understanding of the structure and complexity of algorithmic methods.
One focus is currently on counting and enumeration algorithms, which are investigated in the DFG project Representation Complexity of Counting and Enumeration Problems.
The Algorithms group currently offers the following courses:
Examination information for the winter semester 2023/2024
+49 3677 69-2655
🖷 +49 3677 69-1237
⌂ Zusebau, room 1046