By Topic

Counting axioms do not polynomially simulate counting gates

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Impagliazzo, R. ; Dept. of Comput. Sci., California Univ., San Diego, La Jolla, CA, USA ; Segerlind, N.

We give a family of tautologies whose algebraic translations have constant-degree, polynomial size polynomial calculus refutations over Z2, but which require superpolynomial size bounded-depth Frege proofs from Count2 axioms. This gives a superpolynomial size separation of bounded-depth Frege plus mod 2 counting axioms from bounded-depth Frege plus parity gates. Combined with another result of the authors, it gives the first size (as opposed to degree) separation between the polynomial calculus and Nullstellensatz systems.

Published in:

Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on

Date of Conference:

8-11 Oct. 2001