Konstantin Makarychev. Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs. In Natacha Portier, Thomas Wilke, editors, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany. Volume 20 of LIPIcs, pages 139-147, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. [doi]
Abstract is missing.