Joshua Blinkhorn

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution ACM Transactions on Computational Logic	2023-04-05	Paper
Building strategies into QBF proofs	2022-07-18	Paper
Davis and Putnam meet Henkin: solving DQBF with resolution	2022-03-22	Paper
Size, cost and capacity: a semantic technique for hard random QBFs	2021-06-15	Paper
Building strategies into QBF proofs Journal of Automated Reasoning	2021-06-09	Paper
Strong (D)QBF dependency schemes via tautology-free resolution paths	2021-04-07	Paper
A simple proof of QBF hardness Information Processing Letters	2021-03-11	Paper
Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science	2021-01-21	Paper
scientific article; zbMATH DE number 7228403 (Why is no real title available?)	2020-08-05	Paper
Proof complexity of QBF symmetry recomputation	2020-05-20	Paper
Lower bound techniques for QBF expansion Theory of Computing Systems	2020-04-15	Paper
Dynamic QBF dependencies in reduction and expansion ACM Transactions on Computational Logic	2019-11-22	Paper
Reinterpreting dependency schemes: soundness meets incompleteness in DQBF Journal of Automated Reasoning	2019-09-02	Paper
scientific article; zbMATH DE number 7029312 (Why is no real title available?) (available as arXiv preprint)	2019-02-25	Paper
Shortening QBF proofs with dependency schemes	2017-11-15	Paper

Research outcomes over time

This page was built for person: Joshua Blinkhorn