Explicit Capacity Approaching Coding for Interactive Communication

Publication: 
IEEE Transactions on Information Theory, vol. 64, no. 10, pp. 6546-6560, Oct. 2018, doi: 10.1109/TIT.2018.2829764
IEEE Transactions on Information Theory, 2017.
Year: 
2017
Hide Files

P vs. NP Problem: Efficient Computation...Knowledge

Description: 
Institute for Advanced Study, Princeton, New Jersey - May 16, 2016

Some of My Favorite Open Problems on Expanders and Extractors

Description: 
"Expanders and Extractors" workshop, Berkeley, California - January 31, 2017

Toward Better Formula Lower Bounds: the Composition of a Function and a Universal Relation

Publication: 
SIAM Journal on Computing (SICOMP), vol. 46, no. 1, pp. 114-131, 2017. https://doi.org/10.1137/15M1018319
Year: 
2017
Hide Files

Local Expanders

Publication: 
Springer, Computational Complexity, 2017, DOI 10.1007/s00037-017-0155-1
Electronic Colloquium on Computational Complexity (ECCC) Report TR16-129, pp. 1-13, 2016.
Year: 
2016
Hide Files

Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via Operator Scaling

Publication: 
Geometric and Functional Analysis 2018, https://doi.org/10.1007/s00039-018-0434-2
Proceedings of the Symposium on Theory of Computing (STOC) 2017, pp. 397-409, 2017.
arXiv:1607.06711
Year: 
2017
Hide Files

R. Oliveira

L. Gurvits

A. Garg

A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing

Publication: 
Proceedings of Foundations of Computer Science (FOCS) 2016, pp. 109-117, 2016. https://doi.org/10.1109/FOCS.2016.95.
Year: 
2016
Hide Files

Pages

Subscribe to Avi Wigderson RSS