Theoretical Computer Science I
Team of Prof. Olaf Beyersdorff
Image: Niklas MerkWelcome to the pages of the research group Theoretical Computer Science I.
Our research interests are predominantly in proof complexity, an area in the interface of algorithms (SAT /QBF solving), computational complexity, and computational logic. Currently our research focusses on proof complexity and the theoretical understanding of solvers for quantified Boolean formulas (QBF) and model counting. Further topics of interest include mathematical logic, non-classical logics and cryptography.
The team is led by Professor Olaf Beyersdorff.