Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution. - Olaf Beyersdorff; Benjamin Böhm 001 (Electron. Colloquium Comput. Complex., 2020)

QCDCL with Cube Learning or Pure Literal Elimination - What is best? - Olaf Beyersdorff; Benjamin Böhm 001 (Electron. Colloquium Comput. Complex., 2021)

Should decisions in QCDCL follow prefix order? - Benjamin Böhm 001; Tomás Peitl; Olaf Beyersdorff (Electron. Colloquium Comput. Complex., 2022)

QCDCL vs QBF Resolution: Further Insights. - Benjamin Böhm 001; Olaf Beyersdorff (Electron. Colloquium Comput. Complex., 2023)

Lower Bounds for QCDCL via Formula Gauge. - Benjamin Böhm 001; Olaf Beyersdorff (J. Autom. Reason., 2023)

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

QCDCL with cube learning or pure literal elimination - What is best? - Benjamin Böhm 001; Tomás Peitl; Olaf Beyersdorff (Artif. Intell., 2024)