G. Rothblum

Interactive proofs of proximity: delegating computation in sublinear time

Publication: 
Proceedings of Symposium on the Theory of Computing (STOC) 2013, pp. 793-802, 2013
Year: 
2013
Hide Files

R. Meka

A. Potechin

Sum-of-squares lower bounds for planted clique

Publication: 
Proceedings of the Symposium on Theory of Computing (STOC) 2015, pp. 87-96, 2015.
Year: 
2015
Hide Files

S. Moran

Teaching and compressing for low VC-dimension

Publication: 
Accepted into "Journey Through Discrete Mathematics. A Tribute to Jiri Matousek"
Electronic Colloquium on Computational Complexity (ECCC) Report TR15-025, pp. 1-24, 2015.
Year: 
2015
Hide Files

On Randomness Extraction in ACo

Publication: 
Proceedings of the Computational Complexity Conference (CCC) 2015, pp. 601-668, 2015.
Electronic Colloquium on Computational Complexity (ECCC) Report TR15-003, pp. 1-70, 2015.
Year: 
2015
Hide Files

E. Abbe

Reed-Muller codes for random erasures and errors

Publication: 
IEEE Transactions on Information Theory, vol. 61, no. 10, pp. 5229-5252, 2015.
Proceedings of the Symposium on Theory of Computing (STOC) 2015, pp. 297-306, 2015.
Year: 
2015
Hide Files

Pages

Subscribe to Avi Wigderson RSS