Near-Optimal UGC-hardness of Approximating Max k-CSP_R

Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan. Near-Optimal UGC-hardness of Approximating Max k-CSP_R. In Klaus Jansen, Claire Mathieu, José D. P. Rolim, Chris Umans, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France. Volume 60 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

Abstract

Abstract is missing.