Bypassing UGC from Some Optimal Geometric Inapproximability Results
Rounding Semidefinite Programming Hierarchies via Global Correlation
Agnostic Learning of Monomials by Halfspaces Is Hard
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
Optimal algorithms and inapproximability results for every CSP?
Making the Long Code Shorter
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
ACM Transactions on Algorithms
Combinatorics, Probability and Computing
Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
2009 50th Annual IEEE Symposium on Foundations of Computer Science
Venkatesan Guruswami
David Steurer
Boaz Barak
Yi Wu
ELENA GRIGORESCU
Arnab Bhattacharyya
Guest column