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-0190Full text available as:
Available under licence : See the attached licence file.
In this note we show that the asymmetric Prover–Delayer game developed in Beyersdorff et al. (2010)  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)  and Dantchev and Riis (2001) .
|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|
|Institution:||The University of Leeds|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)|
|Depositing User:||Symplectic Publications|
|Date Deposited:||18 Jul 2012 12:53|
|Last Modified:||05 Jun 2014 02:44|