Topics in Combinatorics: Analysis of Boolean Functions

Free, no sign-up neededSpring 2021English

About this course

In this course, we will mostly be studying Fourier analysis of Boolean functions, which is a useful tool in theoretical computer science, combinatorics, and more. We will start with basic concepts such as influences, noise sensitivity, and hypercontractivity and some basic results in the area.

Description from MIT OpenCourseWare.

Where to take this course