Explore Esty Kelman's in-depth lecture on Random Restrictions and Fourier Concentration, part of the Analysis and TCS Boot Camp series at the Simons Institute. Delve into advanced mathematical concepts and their applications in theoretical computer science as Kelman, from MIT, presents the second part of this topic. Gain insights into the intricate relationships between random restrictions and Fourier analysis, and discover how these techniques are utilized in solving complex computational problems. Enhance your understanding of cutting-edge research in theoretical computer science and its intersection with mathematical analysis during this 56-minute presentation.
Random Restrictions and Fourier Concentration - Part 2
Overview
Syllabus
Random Restrictions and Fourier Concentration 2
Taught by
Simons Institute
Related Courses
-
Random Restrictions and Fourier Concentration - Part 1
-
Fourier Analysis of Boolean Functions - Lecture 8a of CS Theory Toolkit
-
Log-concave Polynomials and Spectral Independence - Part 3
-
Hyper-contractivity in Analysis and Theoretical Computer Science - Introduction 3
-
Log-concave Polynomials and Spectral Independence - Part 2
-
Log-concave Polynomials and Spectral Independence - Part 1
