Skip to main content


Chair of Algorithms and Complexity Theory

Welcome at the Algorithms and Complexity group at the University of Regensburg! We investigate the inherent complexity of fundamental computational problems. Our work focuses particularly on counting problems and related questions in algebraic complexity theory. We also use methods from parameterized complexity theory.

Latest news

Ihre Cookie-Einstellungen haben diese Karte blockiert.

To top