Unique games on expanding constraint graphs are easy
Quadratic Goldreich-Levin Theorems
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08
Julia Wolf
Alexandra Kolla
Subhash A. Khot
Sanjeev Arora
Nisheeth K. Vishnoi
David Steurer
Bypassing UGC from Some Optimal Geometric Inapproximability Results
Guest column