We stand with Ukraine  

Joshua Blinkhorn

Orcid: 0000-0001-7452-6521

According to our database1, Joshua Blinkhorn authored at least 21 papers between 2016 and 2023.

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

2023
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Meena Mahajan
,
Tomás Peitl
ACM Trans. Comput. Log., April, 2023

2021
A simple proof of QBF hardness.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
Inf. Process. Lett., 2021

Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Tomás Peitl
Electron. Colloquium Comput. Complex., 2021

Davis and Putnam Meet Henkin: Solving DQBF with Resolution.
[BibTeX]
[DOI]
Joshua Blinkhorn
,
Tomás Peitl
,
Friedrich Slivovsky
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

2020
Dynamic QBF Dependencies in Reduction and Expansion.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
ACM Trans. Comput. Log., 2020

Lower Bound Techniques for QBF Expansion.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
Theory Comput. Syst., 2020

Simulating DQBF Preprocessing Techniques with Resolution Asymmetric Tautologies.
[BibTeX]
[DOI]
Joshua Blinkhorn
Electron. Colloquium Comput. Complex., 2020

Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Tomás Peitl
Electron. Colloquium Comput. Complex., 2020

Hard QBFs for Merge Resolution.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Meena Mahajan
,
Tomás Peitl
,
Gaurav Sood
Electron. Colloquium Comput. Complex., 2020

Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Meena Mahajan
Electron. Colloquium Comput. Complex., 2020

2019
Quantified Boolean formulas: proof complexity and models of solving.
[BibTeX]
[DOI]
Joshua Blinkhorn
PhD thesis, 2019

Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Leroy Chew
,
Renate A. Schmidt
,
Martin Suda
J. Autom. Reason., 2019

Proof Complexity of Symmetry Learning in QBF.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
Electron. Colloquium Comput. Complex., 2019

Proof Complexity of QBF Symmetry Recomputation.
[BibTeX]
[DOI]
Joshua Blinkhorn
,
Olaf Beyersdorff
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

2018
Building Strategies into QBF Proofs.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Meena Mahajan
Electron. Colloquium Comput. Complex., 2018

Genuine Lower Bounds for QBF Expansion.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Dynamic Dependency Awareness for QBF.
[BibTeX]
[DOI]
Joshua Blinkhorn
,
Olaf Beyersdorff
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
,
Luke Hinde
Electron. Colloquium Comput. Complex., 2017

Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
Electron. Colloquium Comput. Complex., 2017

Shortening QBF Proofs with Dependency Schemes.
[BibTeX]
[DOI]
Joshua Blinkhorn
,
Olaf Beyersdorff
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016
Dependency Schemes in QBF Calculi: Semantics and Soundness.
[BibTeX]
[DOI]
Olaf Beyersdorff
,
Joshua Blinkhorn
Electron. Colloquium Comput. Complex., 2016


  Loading...