pdfformat: 

@InProceedings{barak_et_al:LIPIcs:2015:5298, 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}, title = {{Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {110123}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897897}, ISSN = {18688969}, year = {2015}, volume = {40}, editor = {Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'e} D. P. Rolim}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5298}, URN = {urn:nbn:de:0030drops52981}, doi = {10.4230/LIPIcs.APPROXRANDOM.2015.110}, annote = {Keywords: constraint satisfaction problems, bounded degree, advantage over random} }
Keywords:  constraint satisfaction problems, bounded degree, advantage over random  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)  
Issue date:  2015  
Date of publication:  13.08.2015 