scientific article; zbMATH DE number 7559104
From MaRDI portal
Publication:5090440
DOI10.4230/LIPIcs.ITCS.2019.61MaRDI QIDQ5090440
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1711.11469
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Tropicalization of graph profiles ⋮ The Spectrum of the Grigoriev–Laurent Pseudomoments ⋮ Sum of squares bounds for the ordering principle
Cites Work
- Unnamed Item
- Sums of squares on the hypercube
- Symmetric sums of squares over \(k\)-subset hypercubes
- Symmetry groups, semidefinite programs, and sums of squares
- Sum-of-squares hierarchy lower bounds for symmetric formulations
- Global Optimization with Polynomials and the Problem of Moments
- Sum-of-squares Lower Bounds for Planted Clique
- Sum of Squares Lower Bounds from Pairwise Independence
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Subexponential Algorithms for Unique Games and Related Problems
- On Sets of Acquaintances and Strangers at any Party
- An approach to obtaining global extremums in polynomial mathematical programming problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique
- Sum of squares lower bounds for refuting any CSP
- Quantum entanglement, sum of squares, and the log rank conjecture
- CSP gaps and reductions in the lasserre hierarchy
- Rounding sum-of-squares relaxations
- Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- On the sum-of-squares degree of symmetric quadratic functions
- Flag algebras
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- Expander flows, geometric embeddings and graph partitioning
- Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
- Complexity of Positivstellensatz proofs for the knapsack
This page was built for publication:
