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...
Assuming the Unique Games Conjecture (UGC), the best approximation ratio...
In this paper, we investigate the total coefficient size of Nullstellens...
The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerfu...
We study the rank of the Sum of Squares (SoS) hierarchy over the Boolean...
In this paper, we consider low-degree polynomials of inner products betw...
In this paper we show that simple semidefinite programs inspired by degr...
In this paper, we construct general machinery for proving Sum-of-Squares...
MAX NAE-SAT is a natural optimization problem, closely related to its
be...
The Sum-of-Squares (SoS) hierarchy is a semi-definite programming
meta-a...
Graph matrices are a type of matrix which appears when analyzing the sum...
Given a predicate P: {-1, 1}^k →{-1, 1}, let CSP(P) be the set of
constr...
In this paper, we analyze the sum of squares hierarchy (SOS) on the tota...
In this paper, we show that there exists a balanced linear threshold fun...
We consider two natural problems about nondeterministic finite automata....
In this paper, we develop machinery for proving sum of squares lower bou...
We study planted problems---finding hidden structures in random noisy
in...
In this paper, we investigate property testing whether or not a degree d...
We obtain the first polynomial-time algorithm for exact tensor completio...