Sum of squares lower bounds for refuting any CSP

@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}
}
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

1 Figure or Table

Topics

Statistics

0102020172018
Citations per Year

Citation Velocity: 15

Averaging 15 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.