Abstract
We show that bounded-depth Frege systems with counting axioms modulo m polynomially simulate Nullstellensatz refutations modulo m. When combined with a previous result of the authors, this establishes the first size (as opposed to degree) separation between Nullstellensatz and polynomial calculus refutations. © 2002 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Impagliazzo, R., & Segerlind, N. (2002). Bounded-depth frege systems with counting axioms polynomially simulate Nullstellensatz refutations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2380 LNCS, pp. 208–219). Springer Verlag. https://doi.org/10.1007/3-540-45465-9_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
