The Quest for Strong Inapproximability Results with Perfect Completeness

Joshua Brakensiek, Venkatesan Guruswami. The Quest for Strong Inapproximability Results with Perfect Completeness. In Klaus Jansen, José D. P. Rolim, David Williamson, Santosh Srinivas Vempala, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA. Volume 81 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

Abstract

Abstract is missing.