BIROn - Birkbeck Institutional Research Online

Proof complexity modulo the Polynomial Hierarchy: understanding alternation as a source of hardness

Chen, Hubie (2017) Proof complexity modulo the Polynomial Hierarchy: understanding alternation as a source of hardness. ACM Transactions on Computation Theory 9 (3), ISSN 1942-3454.

[img]
Preview
Text
1410.5369.pdf - Author's Accepted Manuscript

Download (219kB) | Preview

Abstract

We present and study a framework in which one can present alternation-based lower bounds on proof length in proof systems for quantified Boolean formulas. A key notion in this framework is that of proof system ensemble, which is (essentially) a sequence of proof systems where, for each, proof checking can be performed in the polynomial hierarchy. We introduce a proof system ensemble called relaxing QU-res that is based on the established proof system QU-resolution. Our main results include an exponential separation of the treelike and general versions of relaxing QU-res and an exponential lower bound for relaxing QU-res; these are analogs of classical results in propositional proof complexity.

Metadata

Item Type: Article
Additional Information: © ACM, 2017. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published at the link above.
School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User: Hubie Chen
Date Deposited: 18 Apr 2018 12:30
Last Modified: 15 Apr 2025 10:24
URI: https://eprints.bbk.ac.uk/id/eprint/21942

Statistics

6 month trend
280Downloads
6 month trend
211Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item
Edit/View Item