Beating the random assignment on constraint satisfaction problems of bounded degree

Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 1/2 +Ω (1/√ D) fraction of ß's constraints, where D is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a quantum algorithm to find an assignment satisfying a 1/2 +Ω (D-3/4) fraction of the equations. For arbitrary constraint satisfaction problems, we give a similar result for "triangle-free" instances; i.e., an efficient algorithm that finds an assignment satisfying at least a μ + Ω (1/√ D) fraction of constraints, where μ is the fraction that would be satisfied by a uniformly random assignment.

Original languageEnglish (US)
Title of host publicationApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages110-123
Number of pages14
Volume40
ISBN (Print)9783939897897
DOIs
StatePublished - Aug 1 2015
Event18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015 - Princeton, United States
Duration: Aug 24 2015Aug 26 2015

Other

Other18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015
CountryUnited States
CityPrinceton
Period8/24/158/26/15

Fingerprint

Constraint satisfaction problems

Keywords

  • Advantage over random
  • Bounded degree
  • Constraint satisfaction problems

ASJC Scopus subject areas

  • Software

Cite this

Barak, B., Moitra, A., O'Donnell, R., Raghavendra, P., Regev, O., Steurer, D., ... Wright, J. (2015). Beating the random assignment on constraint satisfaction problems of bounded degree. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015 (Vol. 40, pp. 110-123). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.110

Beating the random assignment on constraint satisfaction problems of bounded degree. / Barak, Boaz; Moitra, Ankur; O'Donnell, Ryan; Raghavendra, Prasad; Regev, Oded; Steurer, David; Trevisan, Luca; Vijayaraghavan, Aravindan; Witmer, David; Wright, John.

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015. Vol. 40 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2015. p. 110-123.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Barak, B, Moitra, A, O'Donnell, R, Raghavendra, P, Regev, O, Steurer, D, Trevisan, L, Vijayaraghavan, A, Witmer, D & Wright, J 2015, Beating the random assignment on constraint satisfaction problems of bounded degree. in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015. vol. 40, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 110-123, 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2015, and 19th International Workshop on Randomization and Computation, RANDOM 2015, Princeton, United States, 8/24/15. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.110
Barak B, Moitra A, O'Donnell R, Raghavendra P, Regev O, Steurer D et al. Beating the random assignment on constraint satisfaction problems of bounded degree. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015. Vol. 40. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2015. p. 110-123 https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.110
Barak, Boaz ; Moitra, Ankur ; O'Donnell, Ryan ; Raghavendra, Prasad ; Regev, Oded ; Steurer, David ; Trevisan, Luca ; Vijayaraghavan, Aravindan ; Witmer, David ; Wright, John. / Beating the random assignment on constraint satisfaction problems of bounded degree. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015. Vol. 40 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2015. pp. 110-123
@inproceedings{700898fc6a5144ed9805512ee14ff6ab,
title = "Beating the random assignment on constraint satisfaction problems of bounded degree",
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 1/2 +Ω (1/√ D) fraction of {\ss}'s constraints, where D is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a quantum algorithm to find an assignment satisfying a 1/2 +Ω (D-3/4) fraction of the equations. For arbitrary constraint satisfaction problems, we give a similar result for {"}triangle-free{"} instances; i.e., an efficient algorithm that finds an assignment satisfying at least a μ + Ω (1/√ D) fraction of constraints, where μ is the fraction that would be satisfied by a uniformly random assignment.",
keywords = "Advantage over random, Bounded degree, Constraint satisfaction problems",
author = "Boaz Barak and Ankur Moitra and Ryan O'Donnell and Prasad Raghavendra and Oded Regev and David Steurer and Luca Trevisan and Aravindan Vijayaraghavan and David Witmer and John Wright",
year = "2015",
month = "8",
day = "1",
doi = "10.4230/LIPIcs.APPROX-RANDOM.2015.110",
language = "English (US)",
isbn = "9783939897897",
volume = "40",
pages = "110--123",
booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - Beating the random assignment on constraint satisfaction problems of bounded degree

AU - Barak, Boaz

AU - Moitra, Ankur

AU - O'Donnell, Ryan

AU - Raghavendra, Prasad

AU - Regev, Oded

AU - Steurer, David

AU - Trevisan, Luca

AU - Vijayaraghavan, Aravindan

AU - Witmer, David

AU - Wright, John

PY - 2015/8/1

Y1 - 2015/8/1

N2 - 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 1/2 +Ω (1/√ D) fraction of ß's constraints, where D is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a quantum algorithm to find an assignment satisfying a 1/2 +Ω (D-3/4) fraction of the equations. For arbitrary constraint satisfaction problems, we give a similar result for "triangle-free" instances; i.e., an efficient algorithm that finds an assignment satisfying at least a μ + Ω (1/√ D) fraction of constraints, where μ is the fraction that would be satisfied by a uniformly random assignment.

AB - 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 1/2 +Ω (1/√ D) fraction of ß's constraints, where D is a bound on the number of constraints that each variable occurs in. This improves both qualitatively and quantitatively on the recent work of Farhi, Goldstone, and Gutmann (2014), which gave a quantum algorithm to find an assignment satisfying a 1/2 +Ω (D-3/4) fraction of the equations. For arbitrary constraint satisfaction problems, we give a similar result for "triangle-free" instances; i.e., an efficient algorithm that finds an assignment satisfying at least a μ + Ω (1/√ D) fraction of constraints, where μ is the fraction that would be satisfied by a uniformly random assignment.

KW - Advantage over random

KW - Bounded degree

KW - Constraint satisfaction problems

UR - http://www.scopus.com/inward/record.url?scp=84958520302&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958520302&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.APPROX-RANDOM.2015.110

DO - 10.4230/LIPIcs.APPROX-RANDOM.2015.110

M3 - Conference contribution

SN - 9783939897897

VL - 40

SP - 110

EP - 123

BT - Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 18th International Workshop, APPROX 2015, and 19th International Workshop, RANDOM 2015

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -