approximating max cut with subexponential linear programs - tselil schramm
Published 3 years ago • 840 plays • Length 1:19:57Download video MP4
Download video MP3
Similar videos
-
44:48
2023 ccsp workshop - tselil schramm (stanford)
-
1:02:11
parallel repetition of two prover games: a survey - ran raz
-
1:07:05
towards canonical bases in homology of symplectic resolutions - roman bezrukavnikov
-
1:07:55
mean-field limits for coulomb-type dynamics - sylvia serfaty
-
1:26:07
order, disorder and entropy (lecture - 01) by daan frenkel
-
1:31:49
some half-baked thoughts about de sitter space - leonard susskind
-
1:12:06
crash course on probabilistically checkable proofs (pcp): parallel repetition
-
59:20
hats off to theoretical computer science by nutan limaye