Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution-Reference-Cited by-同舟云学术

Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution

Published:2020-07-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Beyersdorff Olaf¹,Blinkhorn Joshua¹,Mahajan Meena²

Affiliation:

1. Institut für Informatik, Friedrich-Schiller-Universität, Jena, Germany

2. The Institute of Mathematical Sciences, HBNI Chennai, India

Funder

Carl Zeiss Foundation

John Templeton Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3373718.3394793

Reference51 articles.

1. Semi-Algebraic Proofs, IPS Lower Bounds and the tau - Conjecture: Can a Natural Number be Negative;Alekseev Yaroslav;Electronic Colloquium on Computational Complexity,2019

2. Unified QBF certification and its applications

3. Short proofs are narrow—resolution made simple

4. On the correspondence between arithmetic theories and propositional proof systems - a survey

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lower Bounds for QCDCL via Formula Gauge;Journal of Automated Reasoning;2023-09-27

2. Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution;Logical Methods in Computer Science;2023-04-14

3. Hardness Characterisations and Size-width Lower Bounds for QBF Resolution;ACM Transactions on Computational Logic;2023-01-27

4. Proof Complexity of Modal Resolution;Journal of Automated Reasoning;2021-10-13

5. A simple proof of QBF hardness;Information Processing Letters;2021-06