Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations

Details Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations

2003-08-05

arxiv.org/abs/cs/0308012v1

Computer Science

Computational Complexity

17 pages

Scientific paper

We show that constant-depth Frege systems with counting axioms modulo $m$ polynomially simulate Nullstellensatz refutations modulo $m$. Central to this is a new definition of reducibility from formulas to systems of polynomials with the property that, for most previously studied translations of formulas to systems of polynomials, a formula reduces to its translation. When combined with a previous result of the authors, this establishes the first size separation between Nullstellensatz and polynomial calculus refutations. We also obtain new, small refutations for certain CNFs by constant-depth Frege systems with counting axioms.

Affiliated with

Also associated with

No associations

Rating

Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constant-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-571769