Highly Influenced

@inproceedings{Kothari2017SumOS, title={Sum of squares lower bounds for refuting any CSP}, author={Pravesh Kothari and Ryuhei Mori and Ryan M O'Donnell and David Witmer}, booktitle={STOC}, year={2017} }

- Published 2017 in STOC
DOI:10.1145/3055399.3055485

Let <i>P</i>:{0,1}<sup><i>k</i></sup> â {0,1} be a nontrivial <i>k</i>-ary predicate. Consider a random instance of the constraint satisfaction problem (<i>P</i>) on <i>n</i> variables with Î <i>n</i> constraints, each being <i>P</i> applied to <i>k</i> randomly chosen literals. Provided the constraint density satisfies Î â« 1, such an instance is unsatisfiable with high probability. The <em>refutation</em> problem is to efficiently find a proof of unsatisfiability.
We show that whenever… CONTINUE READING

Citations per Year

Averaging **15 citations** per year over the last 2 years.

### Presentations referencing similar topics