Beyersdorff, O, Galesi, N and Lauria, M (2010) A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games. Information Processing Letters, 110 (23). 1074 - 1077 . ISSN 0020-0190
Abstract
In this note we show that the asymmetric Prover–Delayer game developed in Beyersdorff et al. (2010) [2] for Parameterized Resolution is also applicable to other tree-like proof systems. In particular, we use this asymmetric Prover–Delayer game to show a lower bound of the form 2Ω(nlogn) for the pigeonhole principle in tree-like Resolution. This gives a new and simpler proof of the same lower bound established by Iwama and Miyazaki (1999) [7] and Dantchev and Riis (2001) [5].
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2010, Elsevier. This is an author produced version of a paper published in Information Processing Letters. Uploaded in accordance with the publisher's self-archiving policy. |
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) |
Depositing User: | Symplectic Publications |
Date Deposited: | 18 Jul 2012 12:53 |
Last Modified: | 25 Oct 2016 23:12 |
Published Version: | http://dx.doi.org/10.1016/j.ipl.2010.09.007 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.ipl.2010.09.007 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:74432 |