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

The Relative Strength of #SAT Proof Systems. - Olaf Beyersdorff; Johannes Klaus Fichte; Markus Hecher; Tim Hoffmann; Kaspar Kasche (SAT, 2024)

SAT and Interactions (Dagstuhl Seminar 24421). - Olaf Beyersdorff; Laura Kovács; Meena Mahajan; Martina Seidl; Kaspar Kasche (Dagstuhl Reports, 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)

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