Optimal Inapproximability Results for MAX?CUT and Other 2?Variable CSPs?
The UGC Hardness Threshold of theLpGrothendieck Problem
SIAM Journal on Computing
Mathematics of Operations Research
Assaf Naor
Ryan O’Donnell
Elchanan Mossel
Gideon Schechtman
Subhash Khot
Bypassing UGC from Some Optimal Geometric Inapproximability Results