Olaf Beyersdorff

2
Papers
0
Total Citations

Papers (2)

Computationally Hard Problems Are Hard for QBF Proof Systems Too

AAAI 2025
0
citations

Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs

AAAI 2024
0
citations