18.218
Topics in Combinatorics
Topics vary from year to year.
Spring 2021 · Topics in Combinatorics: Analysis of Boolean Functions
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.
Readings
- O’Donnell, Ryan. Analysis of Boolean Functions . Cambridge University Press, New York, NY, 2014. ISBN: 9781107038325.
Prerequisites & course information
Prereq: Permission of instructor G (Spring) 3-0-9 units Can be repeated for credit.
Sources
- Course catalogue ↗2026–2027
- MIT OpenCourseWare ↗Spring 2021
- MIT OCW syllabus ↗
- Historical MIT OpenCourseWare offering. Named reading entries and schedule topics are automatically extracted from the linked source pages.