Lower Bounds for the Polynomial Calculus andthe Groebner Basis

  • AlgorithmRussell Impagliazzo, Pavel Pudl
  • Published 1997


Razborov 5] recently proved that polynomial calculus proofs of the pigeonhole principle PHP m n must have degree at least dn=2e + 1 over any eld. We present a simpliied proof of the same result (Section 2). For more background on the problem refer to 1, 2, 5]. The main idea of our proof is the same as in the original proof of Razborov: we want to describe… (More)


  • Presentations referencing similar topics