Beyersdorff, Olaf

7 publications

AAAI 2025 Computationally Hard Problems Are Hard for QBF Proof Systems Too Agnes Schleitzer, Olaf Beyersdorff

NeurIPS 2025 Exploiting Dynamic Sparsity in Einsum Christoph Staudt, Mark Blacher, Tim Hoffmann, Kaspar Kasche, Olaf Beyersdorff, Joachim Giesen

JAIR 2024 QCDCL vs QBF Resolution: Further Insights Benjamin Böhm, Olaf Beyersdorff

AAAI 2024 Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs Olaf Beyersdorff, Benjamin Böhm, Meena Mahajan

JAIR 2023 Classes of Hard Formulas for QBF Resolution Agnes Schleitzer, Olaf Beyersdorff

IJCAI 2022 QCDCL with Cube Learning or Pure Literal Elimination - What Is Best? Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff

IJCAI 2018 Dynamic Dependency Awareness for QBF Joshua Blinkhorn, Olaf Beyersdorff