default search action
Joshua Blinkhorn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Olaf Beyersdorff, Joshua Blinkhorn
, Meena Mahajan, Tomás Peitl
Hard QBFs for Merge Resolution. ACM Trans. Comput. Theory 16(2): 6:1-6:24 (2024) - [j8]Olaf Beyersdorff
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. ACM Trans. Comput. Theory 16(4): 22:1-22:25 (2024) - 2023
- [j7]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl:
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. ACM Trans. Comput. Log. 24(2): 10:1-10:30 (2023) - 2021
- [j6]Olaf Beyersdorff, Joshua Blinkhorn:
A simple proof of QBF hardness. Inf. Process. Lett. 168: 106093 (2021) - [j5]Olaf Beyersdorff
Building Strategies into QBF Proofs. J. Autom. Reason. 65(1): 125-154 (2021) - [c12]Joshua Blinkhorn
Davis and Putnam Meet Henkin: Solving DQBF with Resolution. SAT 2021: 30-46 - [i12]Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl:
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j4]Olaf Beyersdorff
Lower Bound Techniques for QBF Expansion. Theory Comput. Syst. 64(3): 400-421 (2020) - [j3]Olaf Beyersdorff
Dynamic QBF Dependencies in Reduction and Expansion. ACM Trans. Comput. Log. 21(2): 8:1-8:27 (2020) - [c11]Olaf Beyersdorff
Hard QBFs for Merge Resolution. FSTTCS 2020: 12:1-12:15 - [c10]Olaf Beyersdorff
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. LICS 2020: 209-223 - [c9]Olaf Beyersdorff
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. SAT 2020: 394-411 - [i11]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. CoRR abs/2012.06779 (2020) - [i10]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution. Electron. Colloquium Comput. Complex. TR20 (2020) - [i9]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. Electron. Colloquium Comput. Complex. TR20 (2020) - [i8]Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl:
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths. Electron. Colloquium Comput. Complex. TR20 (2020) - [i7]Joshua Blinkhorn:
Simulating DQBF Preprocessing Techniques with Resolution Asymmetric Tautologies. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [b1]Joshua Blinkhorn:
Quantified Boolean formulas: proof complexity and models of solving. University of Leeds, UK, 2019 - [j2]Olaf Beyersdorff
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. J. Autom. Reason. 63(3): 597-623 (2019) - [j1]Olaf Beyersdorff
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs. Log. Methods Comput. Sci. 15(1) (2019) - [c8]Joshua Blinkhorn, Olaf Beyersdorff
Proof Complexity of QBF Symmetry Recomputation. SAT 2019: 36-52 - [c7]Olaf Beyersdorff
Building Strategies into QBF Proofs. STACS 2019: 14:1-14:18 - [i6]Olaf Beyersdorff, Joshua Blinkhorn:
Proof Complexity of Symmetry Learning in QBF. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c6]Joshua Blinkhorn, Olaf Beyersdorff
Dynamic Dependency Awareness for QBF. IJCAI 2018: 5224-5228 - [c5]Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde:
Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs. ITCS 2018: 9:1-9:18 - [c4]Olaf Beyersdorff
Genuine Lower Bounds for QBF Expansion. STACS 2018: 12:1-12:15 - [i5]Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan:
Building Strategies into QBF Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c3]Joshua Blinkhorn, Olaf Beyersdorff
Shortening QBF Proofs with Dependency Schemes. SAT 2017: 263-280 - [i4]Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde:
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs. CoRR abs/1712.03626 (2017) - [i3]Olaf Beyersdorff, Joshua Blinkhorn:
Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - [i2]Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde:
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c2]Olaf Beyersdorff
Dependency Schemes in QBF Calculi: Semantics and Soundness. CP 2016: 96-112 - [c1]Joshua Blinkhorn, Olaf Beyersdorff:
Dependency Schemes in QBF Calculi: Semantics and Soundness. QBF@SAT 2016: 41-48 - [i1]Olaf Beyersdorff, Joshua Blinkhorn:
Dependency Schemes in QBF Calculi: Semantics and Soundness. Electron. Colloquium Comput. Complex. TR16 (2016)
Coauthor Index
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 2025-01-20 22:51 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: