We stand with Ukraine  

Benjamin Böhm

Orcid: 0000-0002-6098-5572

Affiliations:
  • Friedrich Schiller Universität Jena, Germany


According to our database1, Benjamin Böhm authored at least 7 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
QCDCL with cube learning or pure literal elimination - What is best?
[BibTeX]
[DOI]
Benjamin Böhm
,
Tomás Peitl
,
Olaf Beyersdorff
Artif. Intell., 2024

Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Benjamin Böhm
,
Meena Mahajan
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Lower Bounds for QCDCL via Formula Gauge.
[BibTeX]
[DOI]
Benjamin Böhm
,
Olaf Beyersdorff
J. Autom. Reason., December, 2023

QCDCL vs QBF Resolution: Further Insights.
[BibTeX]
[DOI]
Benjamin Böhm
,
Olaf Beyersdorff
Electron. Colloquium Comput. Complex., 2023

2022
Should decisions in QCDCL follow prefix order?
[BibTeX]
[DOI]
Benjamin Böhm
,
Tomás Peitl
,
Olaf Beyersdorff
Electron. Colloquium Comput. Complex., 2022

2021
QCDCL with Cube Learning or Pure Literal Elimination - What is best?
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Benjamin Böhm
Electron. Colloquium Comput. Complex., 2021

2020
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Benjamin Böhm
Electron. Colloquium Comput. Complex., 2020


  Loading...