On the bit complexity of sum-of-squares proofs

DOI10.4230/LIPICS.ICALP.2017.80MaRDI QIDQ5111411zbMATHOpenAlexFDO

Authors Prasad Raghavendra, Benjamin Weitz

Publication date 27 May 2020

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

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)

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))

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

Cited in

(22)

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

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)