Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz Proofs

11/04/2018
by   Albert Atserias, et al.
0

We show that if a system of degree-k polynomial inequalities on n Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most s many monomials, then it also has one whose degree is of the order of the square root of n s plus k. A similar statement holds for the more general Positivstellensatz (PS) proofs. This establishes size-degree trade-offs for SOS and PS that match their analogues for weaker proof systems such as Resolution, Polynomial Calculus, and the proof systems for the LP and SDP hierarchies of Lovász and Schrijver. As a corollary to this, and to the known degree lower bounds, we get optimal integrality gaps for exponential size SOS proofs for sparse random instances of the standard NP-hard constraint optimization problems. We also get exponential size SOS lower bounds for Tseitin and Knapsack formulas. The proof of our main result relies on a zero-gap duality theorem for pre-ordered vector spaces that admit an order unit, whose specialization to PS and SOS may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2017

Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs

As a natural extension of the SAT problem, an array of proof systems for...
research
11/20/2017

Proof Complexity Meets Algebra

We analyse how the standard reductions between constraint satisfaction p...
research
01/08/2020

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

We establish an exactly tight relation between reversible pebblings of g...
research
01/26/2022

Perfect Matching in Random Graphs is as Hard as Tseitin

We study the complexity of proving that a sparse random regular graph on...
research
05/16/2021

Monomial-size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus

In this paper we consider the relationship between monomial-size and bit...
research
10/31/2022

The power of the Binary Value Principle

The (extended) Binary Value Principle (eBVP: ∑_i=1^n x_i2^i-1 = -k for k...

Please sign up or login with your details

Forgot password? Click here to reset