Parameterized bounded-depth Frege is not optimal

  • Authors:

  • Olaf Beyersdorff;Nicola Galesi;Massimo Lauria;Alexander Razborov

  • Affiliations:

  • Institut für Theoretische Informatik, Leibniz Universität Hannover, Germany;Dipartimento di Informatica, Sapienza Università di Roma, Italy;Dipartimento di Informatica, Sapienza Università di Roma, Italy;Department of Computer Science, The University of Chicago

  • Venue:
  • ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

A general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [9]. There the authors concentrate 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 the present paper significantly improves upon this by showing optimal lower bounds for a parameterized version of boundeddepth 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 [9]. 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 treelike Parameterized Resolution allows short refutations of all parameterized contradictions given as bounded-width CNF's.