14 citations · 56 across the 7 of their papers we have counts for
Showing 2015 · cs.CCShow all
2 papers · 2 filters
cs.CC2015★ 8 cited
How to refute a random CSP
Sarah R. Allen, Ryan O'Donnell, David Witmer
Let be a -ary predicate over a finite alphabet. Consider a random CSP instance over variables with constraints. When the instance will be unsa…
cs.CC2015★ 8 cited
Beating the random assignment on constraint satisfaction problems of bounded degree
Boaz Barak, Ankur Moitra, Ryan O'Donnell +7
We show that for any odd and any instance of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a $\frac…