Beyersdorff, O, Galesi, N, Lauria, M and Razborov, AA (2012) Parameterized Bounded-Depth Frege Is not Optimal. ACM Transactions on Computation Theory, 4 (3). 7.1 - 7.16 . ISSN 1942-3454Full text available as:
Available under License : See the attached licence file.
A general framework for parameterized proof complexity was introduced by Dantchev et al. . There, the authors show important results on tree-like Parameterized Resolution---a parameterized version of classical Resolution---and their gap complexity theorem implies lower bounds for that system. The main result of this article significantly improves upon this by showing optimal lower bounds for a parameterized version of bounded-depth Frege. More precisely, we prove that the pigeonhole principle requires proofs of size nΩ(k) in parameterized bounded-depth Frege, and, as a special case, in dag-like Parameterized Resolution. This answers an open question posed in Dantchev et al. . In the opposite direction, we interpret a well-known technique for FPT algorithms as a DPLL procedure for Parameterized Resolution. Its generalization leads to a proof search algorithm for Parameterized Resolution that in particular shows that tree-like Parameterized Resolution allows short refutations of all parameterized contradictions given as bounded-width CNFs.
|Copyright, Publisher and Additional Information:||© 2012, Association for Computing Machinery. This is an author produced version of a paper published in ACM Transactions on Computation Theory. Uploaded in accordance with the publisher's self-archiving policy.|
|Keywords:||Algorithms, Theory, Proof complexity, Parameterized complexity, Resolution, bounded-depth Frege|
|Academic Units:||The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science|
|Depositing User:||Symplectic Publications|
|Date Deposited:||03 Dec 2012 09:55|
|Last Modified:||08 Feb 2013 17:41|
|Publisher:||Association for Computing Machinery|
Actions (login required)