Lower bounds for the polynomial calculus and the Gröbner basis algorithm

Abstract. Razborov (1996) recently proved that polynomial calculus proofs of the pigeonhole principle $ P H P^m_n $ must have degree at least ⌈n/2⌉ + 1 over any field. We present a simplified proof of the same result.¶Furthermore, we show a matching upper bound on polynomial calculus proofs of the pigeonhole principle for any field of suficiently large characteristic, and an ⌈n/2⌉ + 1 lower bound for any subset sum problem over the field of reals.¶We show that these degree lower bounds also translate into lower bounds on the number of monomials in any polynomial calculus proof, and hence on the running time of most implementations of the Gröbner basis algorithm.

[1]  Miklós Ajtai,et al.  The complexity of the Pigeonhole Principle , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[2]  Jan Krajícek,et al.  Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[3]  Jan Krajíček,et al.  Uniform Families of Polynomial Equations Over a Finite Field and Structures Admitting an Euler Characteristic of Definable Sets , 2000 .

[4]  Jan Kra,et al.  Lower Bounds to the Size of Constant-depth Propositional Proofs , 1994 .

[5]  J. Krajícek.  On the degree of ideal membership proofs from uniform families of polynomials over a finite field , 2001 .

[6]  Jan Krajícek,et al.  Exponential Lower Bounds for the Pigeonhole Principle , 1992, STOC.

[7]  Alexander A. Razborov,et al.  Lower bounds for the polynomial calculus , 1998, computational complexity.

[8]  Paul Beame,et al.  More on the relative strength of counting principles , 1996, Proof Complexity and Feasible Arithmetics.

[9]  Russell Impagliazzo,et al.  Using the Groebner basis algorithm to find proofs of unsatisfiability , 1996, STOC '96.

[10]  JAN KRAJIÂCÏ,et al.  UNIFORM FAMILIES OF POLYNOMIAL EQUATIONS OVER A FINITE FIELD AND STRUCTURES ADMITTING AN EULER CHARACTERISTIC OF DEFINABLE SETS , 2000 .

[11]  Miklós Ajtai,et al.  The independence of the modulo p counting principles , 1994, STOC '94.

[12]  Jan Krajícek,et al.  Lower bounds to the size of constant-depth propositional proofs , 1994, Journal of Symbolic Logic.

[13]  Jan Krajícek,et al.  An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle , 1995, Random Struct. Algorithms.

[14]  D. Gottlieb.  A certain class of incidence matrices , 1966 .

[15]  A RazborovAlexander.  Lower bounds for the polynomial calculus , 1998 .