Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

APPROX
2015
Springer

favoriteEmaildiscussreport

26views Algorithms» more APPROX 2015»

Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree

8 years 6 months ago

Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree

Download www.cs.cmu.edu

Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad R

Real-time Traffic

Algorithms | APPROX 2015 |

claim paper

Related Content

» On bounded occurrence constraint satisfaction

» Beating the Random Ordering is Hard Inapproximability of Maximum Acyclic Subgraph

» Distributed Partial Constraint Satisfaction Problem

» Optimal SheraliAdams Gaps from Pairwise Independence

» A GraphBased Method for Improving GSAT

» Soft arc consistency revisited

» CSP gaps and reductions in the lasserre hierarchy

Post Info
More Details (n/a)

Added	16 Apr 2016
Updated	16 Apr 2016
Type	Journal
Year	2015
Where	APPROX
Authors	Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright

Comments (0)