Fetching the paper…
Reading the bibliography…
One of the most widely studied convex relaxations in combinatorial optimization is the relaxation of the cut polytope $\mathscr C^N$ to the elliptope $\mathscr E^N$, which corresponds to the degree 2 sum-of-squares (SOS) relaxation of optimizing a quadratic form over the hypercube $\{\pm 1\}^N$.
Résumé de la théorie métrique des produits tensoriels topologiques
Alexandre Grothendieck · 1956
Earlier work this paper cites.
Reducibility among combinatorial problems
Richard M Karp · 1972
Earlier work this paper cites.
The matrix equation ax+xb=c
Vladimír Kučera · 1974
Earlier work this paper cites.
Lower bounds on the maximum cross correlation of signals (corresp.)
Lloyd Welch · 1974
Earlier work this paper cites.
6-transitive graphs
Peter J Cameron · 1980
Earlier work this paper cites.
On the computational complexity of ising spin glass models
Francisco Barahona · 1982
Earlier work this paper cites.
Equiangular lines
Petrus WH Lemmens, Johan J Seidel, and JA Green · 1991
Earlier work this paper cites.
Strongly regular graphs with (—1, 1, 0) adjacency matrix having eigenvalue 3
Johan Jacob Seidel · 1991
Earlier work this paper cites.
A note on extreme correlation matrices
Chi-Kwong Li and Bit-Shun Tam · 1994
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X Goemans and David P Williamson · 1995
Earlier work this paper cites.
On a positive semidefinite relaxation of the cut polytope
Monique Laurent and Svatopluk Poljak · 1995
Earlier work this paper cites.
Maximum cuts and large bipartite subgraphs
Svatopluk Poljak and Zsolt Tuza · 1995
Earlier work this paper cites.
Separability of mixed states: necessary and sufficient conditions phys
M Horedecki, P Horodecki, and R Horodecki · 1996
Earlier work this paper cites.
On the facial structure of the set of correlation matrices
Monique Laurent and Svatopluk Poljak · 1996
Earlier work this paper cites.
Separability criterion for density matrices
Asher Peres · 1996
Earlier work this paper cites.
Semidefinite relaxation and nonconvex quadratic optimization
Yurii Nesterov · 1998
Earlier work this paper cites.
On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
Gábor Pataki · 1998
Earlier work this paper cites.
Optimization of entanglement witnesses
Maciej Lewenstein, B Kraus, JI Cirac, and P Horodecki · 2000
Earlier work this paper cites.
Lectures on modern convex optimization: analysis, algorithms, and engineering applications
Ahron Ben-Tal and Arkadi Nemirovski · 2001
Earlier work this paper cites.
Complexity of positivstellensatz proofs for the knapsack
Dima Grigoriev · 2001
Earlier work this paper cites.
Linear lower bound on degrees of positivstellensatz calculus proofs for the parity
Dima Grigoriev · 2001
Earlier work this paper cites.
Global optimization with polynomials and the problem of moments
Jean B Lasserre · 2001
Earlier work this paper cites.
Complexity of semi-algebraic proofs
Dima Grigoriev, Edward A Hirsch, and Dmitrii V Pasechnik · 2002
Earlier work this paper cites.
Finite normalized tight frames
John J Benedetto and Matthew Fickus · 2003
Cited alongside, same era.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Samuel Burer and Renato DC Monteiro · 2003
Cited alongside, same era.
Lower bound for the number of iterations in semidefinite hierarchies for the cut polytope
Monique Laurent · 2003
Cited alongside, same era.
Convex optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Cited alongside, same era.
The structure of claw-free graphs
Maria Chudnovsky and Paul D Seymour · 2005
Cited alongside, same era.
On the unique games conjecture
Subhash Khot and Nisheeth K Vishnoi · 2005
Cited alongside, same era.
The Sherrington-Kirkpatrick model
Dmitry Panchenko · 2013
Later among the works it cites.
Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery
Emmanuel Abbe, Afonso S Bandeira, Annina Bracher, and Amit Singer · 2014
Later among the works it cites.
Sum-of-squares proofs and the quest toward optimal algorithms
Boaz Barak and David Steurer · 2014
Later among the works it cites.
Non-unique games over compact groups and orientation estimation in cryo-em
Afonso S Bandeira, Yutong Chen, and Amit Singer · 2015
Later among the works it cites.
Improved sum-of-squares lower bounds for hidden clique and hidden submatrix problems
Yash Deshpande and Andrea Montanari · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Charles J Colbourn and Jeffrey H Dinitz · 2006
Cited alongside, same era.
On the structure of the body of states with positive partial transpose
Stanisław J Szarek, Ingemar Bengtsson, and Karol Życzkowski · 2006
Cited alongside, same era.
Positive partial transpose from spectra
Roland Hildebrand · 2007
Cited alongside, same era.
Quantum information
Gregg Jaeger · 2007
Cited alongside, same era.
Optimal inapproximability results for max-cut and other 2-variable csps?
Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O’Donnell · 2007
Cited alongside, same era.
On the existence of equiangular tight frames
Mátyás A Sustik, Joel A Tropp, Inderjit S Dhillon, and Robert W Heath Jr · 2007
Cited alongside, same era.
Matthew Fickus and Dustin G Mixon · 2015
Later among the works it cites.
Detailing the equivalence between real equiangular tight frames and certain strongly regular graphs
Matthew Fickus and Cody E Watson · 2015
Later among the works it cites.
Sum-of-squares lower bounds for planted clique
Raghu Meka, Aaron Potechin, and Avi Wigderson · 2015
Later among the works it cites.
A nearly tight sum-of-squares lower bound for the planted clique problem
Boaz Barak, Samuel B Hopkins, Jonathan Kelner, Pravesh Kothari, Ankur Moitra, and Aaron Potechin · 2016
Later among the works it cites.
Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
Hamza Fawzi and Pablo A Parrilo · 2016
Later among the works it cites.
Sparse sums of squares on finite abelian groups and improved semidefinite lifts
Hamza Fawzi, James Saunderson, and Pablo A Parrilo · 2016
Later among the works it cites.
Equiangular tight frames with centroidal symmetry
Matthew Fickus, John Jasper, Dustin G Mixon, Jesse D Peterson, and Cody E Watson · 2016
Later among the works it cites.
Semidefinite programs on sparse random graphs and their application to community detection
Andrea Montanari and Subhabrata Sen · 2016
Later among the works it cites.
Alice and Bob Meet Banach: The Interface of Asymptotic Geometric Analysis and Quantum Information Theory
Guillaume Aubrun and Stanisław J Szarek · 2017
Later among the works it cites.
Geometry of quantum states: an introduction to quantum entanglement
Ingemar Bengtsson and Karol Życzkowski · 2017
Later among the works it cites.
The power of sum-of-squares for detecting hidden structures
Samuel B Hopkins, Pravesh K Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, and David Steurer · 2017
Later among the works it cites.
Fundamental limits of detection in the spiked wigner model
Ahmed El Alaoui, Florent Krzakala, and Michael I Jordan · 2018
Closest in time.
Quadratic Reciprocity II: The Proofs (Lecture Notes), 2009
Pete L Clark · 2018
Closest in time.
On the integrality gap of degree-4 sum of squares for planted clique
Samuel B Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, and Tselil Schramm · 2018
Closest in time.
The inverse eigenvalue problem for entanglement witnesses
Nathaniel Johnston and Everett Patterson · 2018
Closest in time.
Optimality and sub-optimality of pca i: Spiked random matrix models
Amelia Perry, Alexander S Wein, Afonso S Bandeira, Ankur Moitra, et al · 2018
Closest in time.
High-dimensional estimation via sum-of-squares proofs
Prasad Raghavendra, Tselil Schramm, and David Steurer · 2018
Closest in time.