Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Blinkhorn, Joshua
23  Ergebnisse:
Personensuche X
?
1

Hard QBFs for Merge Resolution:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena..
ACM Transactions on Computation Theory.  16 (2024)  2 - p. 1-24 , 2024
Link: https://doi.org/10.1145/..
 
?
2

Hardness Characterisations and Size-width Lower Bounds for ..:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena.
ACM Transactions on Computational Logic.  24 (2023)  2 - p. 1-30 , 2023
Link: https://doi.org/10.1145/..
 
?
3

A simple proof of QBF hardness:

Beyersdorff, Olaf ; Blinkhorn, Joshua
Information Processing Letters.  168 (2021)  - p. 106093 , 2021
Link: https://doi.org/10.1016/..
 
?
4

Davis and Putnam Meet Henkin: Solving DQBF with Resolution:

, In: Theory and Applications of Satisfiability Testing – SAT 2021; Lecture Notes in Computer Science,
Blinkhorn, Joshua ; Peitl, Tomáš ; Slivovsky, Friedrich - p. 30-46 , 2021
Link: https://doi.org/10.1007/..
 
?
5

Strong (D)QBF Dependency Schemes via Tautology-Free Resolut..:

, In: Theory and Applications of Satisfiability Testing – SAT 2020; Lecture Notes in Computer Science,
Beyersdorff, Olaf ; Blinkhorn, Joshua ; Peitl, Tomáš - p. 394-411 , 2020
Link: https://doi.org/10.1007/..
 
?
6

Hardness Characterisations and Size-Width Lower Bounds for ..:

, In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena - p. 209-223 , 2020
Link: https://dl.acm.org/doi/1..
 
?
7

Building Strategies into QBF Proofs:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena
Journal of Automated Reasoning.  65 (2020)  1 - p. 125-154 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Dynamic QBF Dependencies in Reduction and Expansion:

Beyersdorff, Olaf ; Blinkhorn, Joshua
ACM Transactions on Computational Logic (TOCL).  21 (2019)  2 - p. 1-27 , 2019
Link: https://dl.acm.org/doi/1..
 
?
9

Dynamic QBF Dependencies in Reduction and Expansion:

Beyersdorff, Olaf ; Blinkhorn, Joshua
ACM Transactions on Computational Logic.  21 (2019)  2 - p. 1-27 , 2019
Link: https://doi.org/10.1145/..
 
?
10

Lower Bound Techniques for QBF Expansion:

Beyersdorff, Olaf ; Blinkhorn, Joshua
Theory of Computing Systems.  64 (2019)  3 - p. 400-421 , 2019
Link: https://doi.org/10.1007/..
 
?
11

Proof Complexity of QBF Symmetry Recomputation:

, In: Lecture Notes in Computer Science; Theory and Applications of Satisfiability Testing – SAT 2019,
Blinkhorn, Joshua ; Beyersdorff, Olaf - p. 36-52 , 2019
Link: https://doi.org/10.1007/..
 
?
12

Reinterpreting Dependency Schemes: Soundness Meets Incomple..:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Chew, Leroy..
Journal of Automated Reasoning.  63 (2018)  3 - p. 597-623 , 2018
Link: https://doi.org/10.1007/..
 
?
13

Building Strategies into QBF Proofs:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena
Journal of Automated Reasoning -- 0168-7433 -- 1573-0670.  , 2021
Link: https://doi.org/10.1007/..
 
?
14

Hard QBFs for Merge Resolution:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena.
doi:10.4230/LIPIcs.FSTTCS.2020.12.  , 2020
Link: https://doi.org/10.4230/..
 
?
15

Hard QBFs for Merge Resolution:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena..
http://arxiv.org/abs/2012.06779.  , 2020
Link: http://arxiv.org/abs/201..
 
1-15