The sum-product theorem and applications

Description: 
A short talk given at the Institute for Advanced Study, Princeton, New Jersey - May 31, 2019

Arithmetic complexity theory: determinants, permanents and the VP vs. VNP problem

Description: 
A 1-hour talk given at the University of Copenhagen, København, Denmark - May 14, 2019

Optimization, Complexity and Math (through the lens of one problem and one algorithm)

Description: 
University of Copenhagen, København, Denmark - May 14, 2019

Complexity, Optimization and Math (or, Can we prove that P != NP by gradient descent?)

Description: 
A 1-hour talk given at the Fields Institute, Toronto, Ontario, Canada - May 7, 2019

Optimization, Complexity and Math (through the lens of one problem and one algorithm)

Description: 
A 1-hour talk given at the Princeton University, Princeton, New Jersey - April 8, 2019

Cryptography: Secrets and Lies, Knowledge and Trust

Description: 
Virtual Technion Lecture - September 16, 2024

Technical Perspective: Low-depth arithmetic circuits

Author: 
Publication: 
Communications of the ACM, vol. 80, no. 6, pp. 91, 2017. https://doi.org/10.1145/3065468
Hide Files

More barriers for rank methods, via a "numeric to symbolic" transfer

Publication: 
Accepted into Proceedings of Foundations of Computer Science (FOCS) 2019
arXiv:1904.04299
Year: 
2019
Hide Files

V. Makam

Pages

Subscribe to Avi Wigderson RSS