Proof complexity - an introduction

Description: 
March 15, 2016

The Resolution proof system

Description: 
March 22, 2016

Spanoids - an abstraction of spanning structures, and a barrier for LCCs

Publication: 
SIAM Journal on Computing (SICOMP) Volume 49, Issue 3, pp. 465-496 (2020)
Proceedings of the Innovations in Theoretical Computer Science (ITCS) 2019, pp. 32:1-32:20, 2019
Year: 
2020
Files

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

Pages

Subscribe to Avi Wigderson RSS