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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: October 14, 1997.
Rights and permissions
About this article
Cite this article
Impagliazzo, R., Pudlák, P. & Sgall, J. Lower bounds for the polynomial calculus and the Gröbner basis algorithm. comput. complex. 8, 127–144 (1999). https://doi.org/10.1007/s000370050024
Issue Date:
DOI: https://doi.org/10.1007/s000370050024