A Lower Bound for the Pigeonhole Principle in Tree-like Resolution by Asymmetric Prover-Delayer Games

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^@W^(^n^l^o^g^n^) 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].

[1]  Albert Atserias,et al.  A combinatorial characterization of resolution width , 2008, J. Comput. Syst. Sci..

[2]  Eli Ben-Sasson,et al.  Near Optimal Separation Of Tree-Like And General Resolution , 2004, Comb..

[3]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[4]  Maria Luisa Bonet,et al.  Exponential separations between restricted resolution and cutting planes proof systems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5]  Jan Krajícek,et al.  Bounded arithmetic, propositional logic, and complexity theory , 1995, Encyclopedia of mathematics and its applications.

[6]  Pavel Pudlák,et al.  Monotone simulations of nonmonotone propositional proofs , 2000, Electron. Colloquium Comput. Complex..

[7]  Étienne Matheron,et al.  Descriptive Set Theory of Families of Small Sets , 2007, Bull. Symb. Log..

[8]  Serge Abiteboul,et al.  Proceedings of the 21st International Colloquium on Automata, Languages and Programming , 1994 .

[9]  Maria Luisa Bonet,et al.  A study of proof search algorithms for resolution and polynomial calculus , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[10]  Maria Luisa Bonet,et al.  Linear Lower Bounds and Simulations in Frege Systems with Substitutions , 1997, CSL.

[11]  K. Roberts,et al.  Thesis , 2002 .

[12]  Shuichi Miyazaki,et al.  Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle , 1999, ISAAC.

[13]  P. Pudlák.  Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .

[14]  Barnaby Martin,et al.  Parameterized Proof Complexity , 2010, computational complexity.

[15]  J. Krajícek.  Bounded Arithmetic, Propositional Logic, and Complexity Theory: Witnessing theorems , 1995 .

[16]  Michele Zito,et al.  A predicative and decidable characterization of the polynomial classes of languages , 2001, Theor. Comput. Sci..

[17]  Nathan Segerlind,et al.  The Complexity of Propositional Proofs , 2007, Bull. Symb. Log..

[18]  Manfred Kudlek,et al.  On the Complexity of Propositional Calculus Formulae , 2001, Sci. Ann. Cuza Univ..

[19]  Alexander A. Razborov,et al.  Parameterized Bounded-Depth Frege Is not Optimal , 2011, TOCT.

[20]  Russell Impagliazzo,et al.  A lower bound for DLL algorithms for k-SAT (preliminary version) , 2000, SODA '00.

[21]  Olaf Beyersdorff,et al.  Hardness of Parameterized Resolution , 2010, Electron. Colloquium Comput. Complex..

[22]  Ricard Gavaldà,et al.  Monotone Proofs of the Pigeon Hole Principle , 2001, Math. Log. Q..

[23]  Eli Ben-Sasson,et al.  Space complexity of random formulae in resolution , 2003, Random Struct. Algorithms.

[24]  Nicola Galesi.  On the Complexity of Propositional Proof Systems , 2000 .

[25]  Søren Riis,et al.  Tree resolution proofs of the weak pigeon-hole principle , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[26]  G Bongiovanni,et al.  Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy , 1997 .

[27]  Samuel R. Buss,et al.  How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus , 1994, CSL.

[28]  Jochen Messner,et al.  On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution , 2009, ICALP.

[29]  Olaf Beyersdorff,et al.  Parameterized Complexity of DPLL Search Procedures , 2011, SAT.

[30]  Neil Thapen,et al.  The Complexity of Treelike Systems over -Local Formulae , 2004 .

[31]  Toniann Pitassi,et al.  Rank Bounds and Integrality Gaps for Cutting Planes Procedures , 2006, Theory Comput..