session 1b - semi-algebraic proofs, ips lower bounds and the τ-conjecture
Published 4 years ago • 369 plays • Length 29:26Download video MP4
Download video MP3
Similar videos
-
30:00
session 1b - (semi)algebraic proofs over {±1} variables
-
4:06
solving definite integral using algebraic manipulation
-
2:49
solving indefinite integral using algebraic manipulation
-
22:12
on semi-algebraic proofs and algorithms
-
7:30
proving the inequality a(a b) b(b 1) ≥ -1/3
-
24:00
session 1c - a polynomial lower bound on adaptive complexity of submodular maximization
-
9:10
a complex system
-
36:46
approximate degree and quantum query lower bounds via dual polynomials
-
7:32
alternating series 1b - estimating the remainder
-
4:25
mplus cfa partial metric invariance (factor)
-
1:31:05
lecture 5: the propp-wilson algorithm in partially ordered spaces, simulating gibbs measures
-
9:50
gibbs phenomena
-
15:08
a clever solution
-
46:55
natural proofs in algebraic circuit complexity
-
5:15
from drinfeld-sokolov bihamiltonian structures to dubrovin-frobenius manifolds
-
19:45
solving a hodgepodge sum