# Beating the random assignment on constraint satisfaction problems of bounded degree

Electronic Colloquium on Computational Complexity (ECCC), Volume 22, 2015.

Cited by: 30|Views106
EI

Abstract:

We show that for any odd $k$ and any instance of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a $\frac{1}{2} + \Omega(1/\sqrt{D})$ fraction of constraints, where $D$ is a bound on the number of constraints that each variable occurs in. This improves both quali...More

Code:

Data:

Full Text
Bibtex