%0 Conference Paper %1 conf/stacs/Makarychev13 %A Makarychev, Konstantin %B STACS %D 2013 %E Portier, Natacha %E Wilke, Thomas %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 139-147 %T Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs. %U http://dblp.uni-trier.de/db/conf/stacs/stacs2013.html#Makarychev13 %V 20 %@ 978-3-939897-50-7

@inproceedings{conf/stacs/Makarychev13, added-at = {2018-08-23T00:00:00.000+0200}, author = {Makarychev, Konstantin}, biburl = {https://www.bibsonomy.org/bibtex/2f21da6664b7f770c6e5bfb867e4bd970/dblp}, booktitle = {STACS}, crossref = {conf/stacs/2013}, editor = {Portier, Natacha and Wilke, Thomas}, ee = {https://doi.org/10.4230/LIPIcs.STACS.2013.139}, interhash = {7361d09274f0a3a87fbf76289952c175}, intrahash = {f21da6664b7f770c6e5bfb867e4bd970}, isbn = {978-3-939897-50-7}, keywords = {dblp}, pages = {139-147}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:48:30.000+0100}, title = {Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs.}, url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2013.html#Makarychev13}, volume = 20, year = 2013 }