Small-Set Expansion in the 2-Degree Short-Code Graph, the Easier Version

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,600
Published on ● Video Link: https://www.youtube.com/watch?v=sMLSSQTMfmM


Duration: 1:06:18
222 views
3

Guy Kindler (Hebrew University of Jerusalem)
https://simons.berkeley.edu/talks/guy-kindler-hebrew-university-jerusalem-2023-06-27
Beyond the Boolean Cube



Other Videos By Simons Institute for the Theory of Computing


2023-07-01Linearity Testing over the Biased Cube
2023-06-30Sparsifying Sums of Norms
2023-06-30It ain't over till it's over
2023-06-30Separating Quantum from Classical with k-fold Forrelation and Friends
2023-06-29Noise Stability - Beyond the Boolean cube
2023-06-29Erdős and Shannon: A Story of Probability, Communication, and Combinatorics
2023-06-29Fractional Pseudorandom Generators
2023-06-29Strong Bounds for 3-Progressions
2023-06-28Parallel Discrete Sampling via Continuous Walks
2023-06-28Unique Games and Expansion
2023-06-28Small-Set Expansion in the 2-Degree Short-Code Graph, the Easier Version
2023-06-27Product Mixing, Quantum Separation, and Comfortable Juntas
2023-06-27Explicit SoS Lower Bounds from (Small-Set) High Dimensional Expanders
2023-06-27Hypercontractivity Inequality on $\varepsilon$-product Spaces
2023-06-27Reverse Hypercotractivity and Improved Sampling in High Dimensional Expanders
2023-06-26Explicit Orthogonal and Unitary Designs
2023-06-20Simons Institute Live Stream
2023-06-14Computer Vision after the Victory of Data
2023-06-14Communication in the Service of Coordinated Action by Spotted Hyenas
2023-06-14Do Elephants Have Names? Vocal Labeling of Individual Conspecifics in African Elephants + ...
2023-06-14Generative AI and What Is Meaningful Sperm Whale Communication


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Beyond the Boolean Cube
Guy Kindler