In [Sau11,SPW13], Saunderson, Parrilo and Willsky asked the following el...
Given a graph and an integer k, Densest k-Subgraph is the algorithmic
ta...
We study the computational complexity of two related problems: recoverin...
We give efficient algorithms for finding power-sum decomposition of an i...
The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerfu...
An active topic in the study of random constraint satisfaction problems
...
The degree-4 Sum-of-Squares (SoS) SDP relaxation is a powerful algorithm...