Topics in Combinatorics: Analysis of Boolean Functions
18.218 · Mathematics · Graduate · Spring 2021
Prof. Dor Minzer
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.
The syllabus, on MIT OpenCourseWare
The full course — syllabus, assigned readings, problem sets, exams, and lecture notes — lives on OCW. These open the real thing:
Syllabus ↗
Course overview, grading, schedule
Readings ↗
The assigned reading list, session by session
Assignments ↗
Problem sets and projects
Full course on OCW ↗
Everything, including lecture materials
Attribution
Prof. Dor Minzer. 18.218 Topics in Combinatorics: Analysis of Boolean Functions. Spring 2021. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu. License: CC BY-NC-SA 4.0.
Course materials are © their authors and licensed CC BY-NC-SA 4.0. CurrMana links to the source and does not re-host them.