A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games

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

Metadata

Authors/Creators:
  • Beyersdorff, O
  • Galesi, N
  • Lauria, M
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: 25 Oct 2016 23:12
Published Version: http://dx.doi.org/10.1016/j.ipl.2010.09.007
Status: Published
Publisher: Elsevier
Identification Number: https://doi.org/10.1016/j.ipl.2010.09.007

Download

Filename: tree-like-php.pdf

Share / Export

Statistics