Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree

Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree

We show that for any odd k and any instance I of the max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a 1/2 + Omega(1/sqrt(D)) fraction of I's constraints, where D is a bound on the number of constraints that each variable oc...

Full description

Bibliographic Details
Main Authors: Barak, Boaz (Author), O'Donnell, Ryan (Author), Raghavendra, Prasad (Author), Regev, Oded (Author), Steurer, David (Author), Trevisan, Luca (Author), Vijayaraghavan, Aravindan (Author), Witmer, David (Author), Wright, John (Author), Moitra, Ankur (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016-10-06T22:02:37Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items