default search action
Benjamin Böhm 0001
Person information
- affiliation: Friedrich Schiller Universität Jena, Germany
Other persons with the same name
- Benjamin Böhm 0002
— Technical University of Darmstadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Benjamin Böhm
QCDCL with cube learning or pure literal elimination - What is best? Artif. Intell. 336: 104194 (2024) - [j4]Benjamin Böhm
QCDCL vs QBF Resolution: Further Insights. J. Artif. Intell. Res. 81: 741-769 (2024) - [j3]Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
Should Decisions in QCDCL Follow Prefix Order? J. Autom. Reason. 68(1): 5 (2024) - [c6]Olaf Beyersdorff, Benjamin Böhm, Meena Mahajan:
Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs. AAAI 2024: 7943-7951 - 2023
- [j2]Benjamin Böhm, Olaf Beyersdorff:
Lower Bounds for QCDCL via Formula Gauge. J. Autom. Reason. 67(4): 35 (2023) - [j1]Olaf Beyersdorff, Benjamin Böhm:
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution. Log. Methods Comput. Sci. 19(2) (2023) - [c5]Benjamin Böhm, Olaf Beyersdorff:
QCDCL vs QBF Resolution: Further Insights. SAT 2023: 4:1-4:17 - [i5]Benjamin Böhm, Olaf Beyersdorff:
QCDCL vs QBF Resolution: Further Insights. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c4]Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
QCDCL with Cube Learning or Pure Literal Elimination - What is Best? IJCAI 2022: 1781-1787 - [c3]Benjamin Böhm, Tomás Peitl
Should Decisions in QCDCL Follow Prefix Order? SAT 2022: 11:1-11:19 - [i4]Benjamin Böhm, Tomás Peitl, Olaf Beyersdorff:
Should decisions in QCDCL follow prefix order? Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c2]Olaf Beyersdorff
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution. ITCS 2021: 12:1-12:20 - [c1]Benjamin Böhm, Olaf Beyersdorff:
Lower Bounds for QCDCL via Formula Gauge. SAT 2021: 47-63 - [i3]Olaf Beyersdorff, Benjamin Böhm:
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution. CoRR abs/2109.04862 (2021) - [i2]Olaf Beyersdorff, Benjamin Böhm:
QCDCL with Cube Learning or Pure Literal Elimination - What is best? Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i1]Olaf Beyersdorff, Benjamin Böhm:
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution. Electron. Colloquium Comput. Complex. TR20 (2020)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 19:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: