Homogenization and the polynomial calculus

@article{BureshOppenheim2002HomogenizationAT,
  title={Homogenization and the polynomial calculus},
  author={Joshua Buresh-Oppenheim and Matthew Clegg and Russell Impagliazzo and Toniann Pitassi},
  journal={computational complexity},
  year={2002},
  volume={11},
  pages={91-108}
}
In standard implementations of the Gröbner 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… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
12 Citations
15 References
Similar Papers

Similar Papers

Loading similar papers…