Non-commutative arithmetic computation

Submitted by sgriffin on Thu, 2020-03-19 13:01
Description: 
February 11 & 18, 2014
File: 
Video - Part 1
Video - Part 2

Sum-of-squares lower bounds for the planted clique problem

Submitted by sgriffin on Thu, 2020-03-19 12:54
Description: 
November 25, 2014 (continued in "More on sum-of-squares proofs for planted clique")
File: 
Video

More on sum-of-squares proofs for planted clique

Submitted by sgriffin on Thu, 2020-03-19 12:50
Description: 
December 9, 2014 (continuation of "Sum-of-squares lower bounds for the planted clique problem" )
File: 
Video

Proof Complexity Lower Bounds from Algebraic Circuit Complexity

Submitted by sgriffin on Thu, 2020-03-19 12:16
Description: 
Michael Forbes - January 19, 2016
File: 
Video

The singularity of symbolic matrices

Submitted by sgriffin on Thu, 2020-03-19 11:54
Description: 
February 8, 9 & 16, 2016
File: 
Video - Part 1
Video - Part 2
Video - Part 3

Proof complexity - an introduction

Submitted by sgriffin on Thu, 2020-03-19 11:48
Description: 
March 15, 2016
File: 
Video

The Resolution proof system

Submitted by sgriffin on Thu, 2020-03-19 11:17
Description: 
March 22, 2016
File: 
Video

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

Submitted by sgriffin on Tue, 2020-02-11 13:56
Author: 
Z. Dvir
S. Gopi
Y. Gu
A. Wigderson
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
Hide Files
File: 
Final journal version (pdf)
Conference version (pdf)

Pages

Subscribe to Avi Wigderson RSS