Dagstuhl-Seminar — Algebraic and Analytic Methods in Computational Complexity

Please note that the event you are currently viewing has already passed and is now considered archived.

Dates	September 15-20, 2024
Location	Schloss Dagstuhl, Germany
Organizer	Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
Topics	Computer Science and IT Mathematics
Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.

Similar events