Tree resolution proofs of the weak pigeon-hole principle

We prove that any optimal tree resolution proof of PHP/sub n//sup m/ is of size 2/sup /spl theta/(n log n)/, independently from m, even if it is infinity. So far, only a 2/sup /spl Omega/(n)/ lower bound has been known in the general case. We also show that any, not necessarily optimal, regular tree resolution proof PHP/sub n//sup m/ is bounded by 2/sup O(n log m)/. To the best of our knowledge, this is the first time the worst case proof complexity has been considered. Finally, we discuss possible connections of our result to Riis' (1999) complexity gap theorem for tree resolution.

[1]  Ran Raz,et al.  Regular resolution lower bounds for the weak pigeonhole principle , 2001, STOC '01.

[2]  Stefan Dantchev,et al.  A Tough Nut for Tree Resolution , 2000 .

[3]  Søren Riis.  A complexity gap for tree resolution , 2001, computational complexity.

[4]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

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

[6]  Samuel R. Buss,et al.  Resolution Proofs of Generalized Pigeonhole Principles , 1988, Theor. Comput. Sci..

[7]  Samuel R. Buss,et al.  Resolution and the Weak Pigeonhole Principle , 1997, CSL.

[8]  Generating Hard Tautologies Using Predicate Logic and the Symmetric Group , 1998 .

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

[10]  Alexander A. Razborov,et al.  Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus , 1997, STOC '97.

[11]  Pavel Pudlák.  Proofs as Games , 2000, Am. Math. Mon..

[12]  Meera Sitharam,et al.  Generating hard tautologies using predicate logic and the symmetric group , 1998, Log. J. IGPL.

[13]  Toniann Pitassi,et al.  Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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