On the bit complexity of sum-of-squares proofs
From MaRDI portal
(Redirected from Publication:5111411)
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
Cited in
(28)- Tight size-degree bounds for sums-of-squares proofs
- Lift \& project systems performing on the partial-vertex-cover polytope
- Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials
- Mean estimation with sub-Gaussian rates in polynomial time
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
- Harmonicity and invariance on slices of the Boolean cube
- Tight size-degree bounds for sums-of-squares proofs
- SOS is not obviously automatizable, even approximately
- Disordered systems insights on computational hardness
- scientific article; zbMATH DE number 7559384 (Why is no real title available?)
- SOS lower bounds with hard constraints: think global, act local
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs
- scientific article; zbMATH DE number 7561747 (Why is no real title available?)
- Ideal membership problem over 3-element CSPs with dual discriminator polymorphism
- Approximability and proof complexity
- Sum-of-squares hierarchies for binary polynomial optimization
- Sum-of-squares hierarchies for binary polynomial optimization
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
- The Spectrum of the Grigoriev–Laurent Pseudomoments
- Sum-of-squares lower bounds for densest k-subgraph
- Semialgebraic proofs, IPS lower bounds, and the -conjecture: can a natural number be negative?
- Feasible interpolation for polynomial calculus and sums-of-squares
- Approximation algorithms for _p-shortest path and _p-group Steiner tree
- Computational complexity of sum-of-squares bounds for copositive programs
- Separations in proof complexity and TFNP
- Ideal membership problem for Boolean minority and dual discriminator
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)
