Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Barbara Aquilani
Daisei Uchida
Hiroyuki Sato
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Jianghua Ge
Home
/
Author
/
JOSHUA BLINKHORN
Author Info
Open Visualization
Name
Affiliation
Papers
JOSHUA BLINKHORN
Univ Leeds, Sch Comp, Leeds, W Yorkshire, England
18
Collaborators
Citations
PageRank
9
3
6.16
Referers
Referees
References
7
89
51
Publications (18 rows)
Collaborators (9 rows)
Referers (7 rows)
Referees (89 rows)
Title
Citations
PageRank
Year
A simple proof of QBF hardness
0
0.34
2021
Building Strategies Into Qbf Proofs
0
0.34
2021
Davis and Putnam Meet Henkin: Solving DQBF with Resolution
0
0.34
2021
Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths.
0
0.34
2020
Lower Bound Techniques for QBF Expansion
0
0.34
2020
Dynamic QBF Dependencies in Reduction and Expansion
0
0.34
2020
Hard QBFs for Merge Resolution
0
0.34
2020
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
0
0.34
2020
Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF
0
0.34
2019
Proof Complexity of Symmetry Learning in QBF.
0
0.34
2019
Proof Complexity of QBF Symmetry Recomputation.
0
0.34
2019
Dynamic Dependency Awareness for QBF.
0
0.34
2018
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs.
1
0.39
2018
Genuine Lower Bounds for QBF Expansion.
0
0.34
2018
Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds.
0
0.34
2017
Shortening QBF Proofs with Dependency Schemes.
2
0.37
2017
Dependency Schemes In Qbf Calculi: Semantics And Soundness
0
0.34
2016
Dependency Schemes in QBF Calculi: Semantics and Soundness.
0
0.34
2016
1