Bounded-Depth Frege with Counting Principles Polynomially Simulates Nullstellensatz Refutations
Skip to main content
eScholarship
Open Access Publications from the University of California

Bounded-Depth Frege with Counting Principles Polynomially Simulates Nullstellensatz Refutations

Abstract

We show that bounded-depth Frege systems with counting principles modulo m can polynomially simulate Nullstellensatz refutations modulo m. This establishes new upper bounds for proofs of certain tautologies in bounded-depth Frege with counting axioms systems. When combined with another result of the authors, this simulation establishes a size (as opposed to a degree) separation between Nullstellensatz and polynomial calculus refutations.

Pre-2018 CSE ID: CS2001-0686

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View