Homogenization and the polynomial calculus
In standard implementations of the Grobner basis algorithm, the original polynomials are homogenized so that each term in a given polynomial has the same degree. In this paper, we study the effect of homogenization on the proof complexity of refutations of polynomials derived from Boolean formulas in both the Polynomial Calculus (PC) and Nullstellensatz systems. We show that the PC refutations of homogenized formulas give crucial information about the complexity of the original formulas. The minimum PC refutation degree of homogenized formulas is equal to the Nullstellensatz refutation degree of the original formulas, whereas the size of the homogenized PC refutation is equal to the size of the PC refutation for the originals. Using this relationship, we prove nearly linear (Omega(n/log n) vs. O(1)) separations between Nullstellensatz and PC degree, for a family of explicitly constructed contradictory 3CNF formulas. Previously, an Omega(n(1/2)) separation had been proved for equations that did not correspond to any CNF formulas, and a log n separation for equations derived from kCNF formulas.
grobner basis algorithm proof complexity algebraic proofs satisfiability