expansion in graphs, codes, and proofs
Published Streamed 2 years ago • 510 plays • Length 34:00Download video MP4
Download video MP3
Similar videos
-
55:15
pseudorandomness and regularity in graphs i
-
42:07
connection between codes and hdx part 1
-
1:08:30
expansion from a cohomological viewpoint
-
33:00
locally testable codes and cayley graphs
-
58:58
on graph spectra and small set expansion
-
53:01
2-to-2 games, the grassmann graph, and hyper-contractivity
-
55:55
miles cranmer - the next great scientific theory is hiding inside a neural network (april 3, 2024)
-
1:01:51
lecture 1: introduction to information theory
-
49:52
decoding quantum low density parity check codes
-
35:28
connection between codes and hdx part 2
-
31:32
highlight multi-pass effect in unity | post-processing with c#, urp, srp, hlsl, & frame debugger
-
41:32
discrete tori and bounds for linear codes
-
38:32
expansion of higher-dimensional cubical complexes with application to good ...
-
34:00
the uncanny usefulness of constructive proofs of pseudorandomness
-
1:06:18
small-set expansion in the 2-degree short-code graph, the easier version
-
30:46
statistical estimation on graphs
-
44:13
abstract polymer models and the cluster expansion
-
1:02:36
graph sparsification iii: interlacing polynomials and ramanujan graphs of every degree
-
26:04
expander graphs application 1: good codes || @ cmu || lecture 16b of cs theory toolkit
-
58:30
probabilistically checkable proofs (part i)
-
45:52
small lifts of expander graphs are expanding
-
47:43
optimizing dynamic-graph data structures on multicores with the locality-first strategy