Benjamin Böhm

According to our database, Benjamin Böhm authored at least 8 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

complexity of quantified conflict driven clause learning.

Benjamin Böhm

PhD thesis, 2025

2024

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

Olaf Beyersdorff, Benjamin Böhm, Meena Mahajan

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

QCDCL vs QBF Resolution: Further Insights.

Benjamin Böhm, Olaf Beyersdorff

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

2022

Should Decisions in QCDCL Follow Prefix Order?

Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

QCDCL with Cube Learning or Pure Literal Elimination - What is Best?

Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

QCDCL with Cube Learning or Pure Literal Elimination - What is best?

Olaf Beyersdorff, Benjamin Böhm

Electron. Colloquium Comput. Complex., 2021

Lower Bounds for QCDCL via Formula Gauge.

Benjamin Böhm, Olaf Beyersdorff

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution.

Olaf Beyersdorff, Benjamin Böhm

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021