Jan 17, 2017 · Our results (which also extend with no change to CSPs over larger alphabets) subsume all previously known lower bounds for semialgebraic refutation of random ...
The sum of squares (SOS) algorithm of degree d = Θ(n/Δ 2/(t-1) logΔ) (which runs in time n O(d) ) cannot refute a random instance of (P).
Our results (which also extend with no change to CSPs over larger alphabets) subsume all previously known lower bounds for semialgebraic ...
Duration: 30:31
Posted: Apr 10, 2017
Posted: Apr 10, 2017
Sum of Squares Lower Bounds for Refuting Any CSP. Workshop. Structure vs. Randomness. Speaker(s). Ryan O'Donnell, Carnegie Mellon University. Location. Date.
Dec 13, 2016 · We show that whenever the predicate P fails to support a t-wise-uniform probability distribution over its satisfying assignments, the Sum-of- ...
Jan 17, 2017 · Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random · Extended Formulation Lower Bounds for Refuting Random ...
This is the first result to show a distinction between the degree SOS needs to solve the refutation problem and the degree it needs to solve the harder δ- ...
In the last few years, there has been some progress in proving sum-of-squares lower bounds for average-case problems [Gri01, GV02, Sch08, Tul09b, BCK15, BHK + ...
Duration: 2:02:51
Posted: Dec 13, 2016
Posted: Dec 13, 2016