The Projection Games Conjecture and The NP-Hardness of ln n-Approximating Set-Cover.
Dana Moshkovitz · Electronic colloquium on computational complexity · 2011
We suggest the research agenda of establishing new hardness of approximation results based on the “projection games conjecture”, i.e., an instantiation of the Sliding Scale Conjecture of Bellare, Goldwasser, Lund and Russell to projection games.