Lower bounds on Nullstellensatz proofs via designs

@inproceedings{Buss1996LowerBO,
  title={Lower bounds on Nullstellensatz proofs via designs},
  author={Samuel R. Buss},
  booktitle={Proof Complexity and Feasible Arithmetics},
  year={1996}
}
  • Samuel R. Buss
  • Published 1996 in Proof Complexity and Feasible Arithmetics
The Nullstellensatz proof system is a proof system for propositional logic based on algebraic identities in fields. Prior work has proved lower bounds of the degree Nullstellensatz refutations using combinatorial constructions called designs. This paper surveys the use of designs for Nullstellensatz lower bounds. We give a new, more general definition of designs. We present an explicit construction of designs which give a linear lower bound on the degree of Nullstellensatz proofs of the… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Gr obner proofs, in Proceedings of the Twenty-eighth

  • M. Clegg, J. Edmonds, R. Impagliazzo
  • Annual ACM Symposium on the Theory of Computing…
  • 1996
Highly Influential
9 Excerpts

Pudl ak, Lower bounds on Hilbert's Nullstellensatz and propositional proofs, in Thirty

  • P. Beame, R. Impagliazzo, J. Kraj cek, T. Pitassi
  • fth Annual Symposium on Foundations of Computer…
  • 1994
2 Excerpts

Similar Papers

Loading similar papers…