Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through Circuits and Degree. - Olaf Beyersdorff; Tim Hoffmann; Kaspar Kasche; Luc Nicolas Spachmann (MFCS, 2024)

Polynomial Calculus for Quantified Boolean Logic: Lower Bounds through Circuits and Degree. - Olaf Beyersdorff; Kaspar Kasche; Luc Nicolas Spachmann (Electron. Colloquium Comput. Complex., 2024)

Proof Complexity of Propositional Model Counting. - Olaf Beyersdorff; Tim Hoffmann; Luc Nicolas Spachmann (J. Satisf. Boolean Model. Comput., 2024)

Semi-Algebraic Proof Systems for QBF. - Olaf Beyersdorff; Ilario Bonacina; Kaspar Kasche; Meena Mahajan; Luc Nicolas Spachmann (SAT, 2025)