Explore a comprehensive lecture on Random Restrictions and Fourier Concentration presented by Esty Kelman from MIT as part of the Analysis and TCS Boot Camp at the Simons Institute. Delve into advanced mathematical concepts and their applications in theoretical computer science, gaining insights into the intricate relationship between random restrictions and Fourier analysis. Enhance your understanding of these complex topics through expert explanations and in-depth discussions during this hour-long session.
Random Restrictions and Fourier Concentration - Part 1
Overview
Syllabus
Random Restrictions and Fourier Concentration 1
Taught by
Simons Institute
Related Courses
-
Random Restrictions and Fourier Concentration - Part 2
-
Log-concave Polynomials and Spectral Independence - Part 1
-
Hyper-contractivity in Analysis and Theoretical Computer Science - Introduction 3
-
Fourier Analysis of Boolean Functions - Lecture 8a of CS Theory Toolkit
-
Log-concave Polynomials and Spectral Independence - Part 3
-
PCPs and Global Hyper-contractivity - Lecture 1
