Bypassing UGC from Some Optimal Geometric Inapproximability Results
Agnostic Learning of Monomials by Halfspaces Is Hard
ACM Transactions on Algorithms
2009 50th Annual IEEE Symposium on Foundations of Computer Science
Prasad Raghavendra
Venkatesan Guruswami
Vitaly Feldman
Rishi Saket