YoVDO

Towards a Proof of the Fourier Entropy Conjecture

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Mathematics Courses Theoretical Computer Science Courses

Course Description

Overview

Explore a 23-minute IEEE conference talk on the Fourier Entropy Conjecture, presented by researchers from Tel Aviv University, Hebrew University of Jerusalem, and the Institute for Advanced Study. Delve into key concepts such as Fourier Distribution, Concentration Entropies, Total Influence, and the Logarithmic Barrier. Gain insights into related results and the potential progress towards proving this important conjecture in mathematics and computer science.

Syllabus

Introduction
Fourier Distribution
Outline
Concentration
Entropies
Total Influence
Logarithmic Barrier
Fourier Entropy Influence
Related Results
Conclusion


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
IEEE via YouTube
Computation in the Brain Tutorial - Part 2
IEEE via YouTube
Computation in the Brain - Part 1
IEEE via YouTube
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube
Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube