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

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera