Beyersdorff, O, Galesi, N and Lauria, M (2013) A characterization of tree-like resolution size. Information Processing Letters, 113 (18). 666 - 671. ISSN 0020-0190
Abstract
We explain an asymmetric Prover-Delayer game which precisely characterizes proof size in tree-like Resolution. This game was previously described in a parameterized complexity context to show lower bounds for parameterized formulas (Beyersdorff et al. (2013) [2]) and for the classical pigeonhole principle (Beyersdorff et al. (2010) [1]). The main point of this note is to show that the asymmetric game in fact characterizes tree-like Resolution proof size, i.e. in principle our proof method allows to always achieve the optimal lower bounds. This is in contrast with previous techniques described in the literature. We also provide a very intuitive information-theoretic interpretation of the game.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | (c) 2013, Elsevier. NOTICE: this is the author’s version of a work that was accepted for publication in Information Processing Letters. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Information Processing Letters, 113, 18, 2013, 10.1016/j.ipl.2013.06.002 |
Keywords: | Computational complexity; Proof complexity; Prover–Delayer games; Resolution |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 23 Jun 2014 10:46 |
Last Modified: | 18 Jan 2018 13:42 |
Published Version: | http://dx.doi.org/10.1016/j.ipl.2013.06.002 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.ipl.2013.06.002 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:79312 |