
Resolution and the binary encoding of combinatorial principles
We investigate the size complexity of proofs in Res(s)  an extension o...
read it

Monomialsize vs. Bitcomplexity in SumsofSquares and Polynomial Calculus
In this paper we consider the relationship between monomialsize and bit...
read it

DRAT and Propagation Redundancy Proofs Without New Variables
We study the proof complexity of RAT proofs and related systems includin...
read it

Hidden variables simulating quantum contextuality increasingly violate the Holevo bound
In this paper from 2011 we approach some questions about quantum context...
read it

Resolution with Counting: Lower Bounds over Different Moduli
Resolution over linear equations (introduced in [RT08]) emerged recently...
read it

SheraliAdams and the binary encoding of combinatorial principles
We consider the SheraliAdams (SA) refutation system together with the u...
read it

Mimicking Networks Parameterized by Connectivity
Given a graph G=(V,E), capacities w(e) on edges, and a subset of termina...
read it
A Lower Bound for Polynomial Calculus with Extension Rule
In this paper we study an extension of the Polynomial Calculus proof system where we can introduce new variables and take a square root. We prove that an instance of the subsetsum principle, the binary value principle, requires refutations of exponential bit size over rationals in this system. Part and Tzameret proved an exponential lower bound on the size of ResLin (Resolution over linear equations) refutations of the binary value principle. We show that our system psimulates ResLin and thus we get an alternative exponential lower bound for the size of ResLin refutations of the binary value principle.
READ FULL TEXT
Comments
There are no comments yet.