Optimal Inapproximability Results for MAX?CUT and Other 2?Variable CSPs?
A quantitative gibbard-satterthwaite theorem without neutrality
SIAM Journal on Computing
Proceedings of the 44th symposium on Theory of Computing - STOC ’12
Miklós Z. Rácz
Ryan O’Donnell
Guy Kindler
Subhash Khot
Generalized Decision Scoring Rules
Bypassing UGC from Some Optimal Geometric Inapproximability Results