On the bit complexity of sum-of-squares proofs

DOI10.4230/LIPICS.ICALP.2017.80zbMATH Open1441.68100arXiv1702.05139OpenAlexW2594565427MaRDI QIDQ5111411FDOQ5111411

Authors: Prasad Raghavendra, Benjamin Weitz 

Publication date: 27 May 2020

Abstract: It has often been claimed in recent papers that one can find a degree d Sum-of-Squares proof if one exists via the Ellipsoid algorithm. In [O17], Ryan O'Donnell notes this widely quoted claim is not necessarily true. He presents an example of a polynomial system with bounded coeffcients that admits low-degree proofs of non-negativity, but these proofs necessarily involve numbers with an exponential number of bits, causing the Ellipsoid algorithm to take exponential time. In this paper we obtain both positive and negative results on the bit complexity of SoS proofs. First, we propose a suffcient condition on a polynomial system that implies a bound on the coefficients in an SoS proof. We demonstrate that this sufficient condition is applicable for common use-cases of the SoS algorithm, such as Max-CSP, Balanced Separator, Max- Clique, Max-Bisection, and Unit-Vector constraints. On the negative side, O'Donnell asked whether every polynomial system containing Boolean constraints admits proofs of polynomial bit complexity. We answer this question in the negative, giving a counterexample system and non-negative polynomial which has degree two SoS proofs, but no SoS proof with small coefficients until degree Omega(sqrt(n))

Full work available at URL: https://arxiv.org/abs/1702.05139

Recommendations

• Approximability and proof complexity
• SOS is not obviously automatizable, even approximately
• Tight size-degree bounds for sums-of-squares proofs
• Tight size-degree bounds for sums-of-squares proofs
• Sum-of-squares proofs and the quest toward optimal algorithms

zbMATH Keywords

combinatorial optimizationproof complexitysum-of-squares

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Complexity of proofs (03F20)

Cited In (22)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximability and proof complexity
• Lift \& project systems performing on the partial-vertex-cover polytope
• Title not available (Why is that?)
• Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?
• Harmonicity and invariance on slices of the Boolean cube
• Mean estimation with sub-Gaussian rates in polynomial time
• Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)
• Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
• A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
• The Spectrum of the Grigoriev–Laurent Pseudomoments
• Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
• Tight size-degree bounds for sums-of-squares proofs
• Tight size-degree bounds for sums-of-squares proofs
• Sum-of-squares lower bounds for densest \(k\)-subgraph
• Disordered systems insights on computational hardness
• SOS is not obviously automatizable, even approximately
• A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
• Sum-of-squares hierarchies for binary polynomial optimization
• Sum-of-squares hierarchies for binary polynomial optimization
• Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials

This page was built for publication: On the bit complexity of sum-of-squares proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111411)