file.pdf (318.51 kB)
Some Topics in Analysis of Boolean Functions
journal contribution
posted on 1968-01-01, 00:00 authored by Ryan O'DonnellThis article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a brief introduction to Fourier analysis of boolean functions and then discuss some applications: Arrow's Theorem and other ideas from the theory of Social Choice; the Bonami-Beckner Inequality as an extension of Chernoff/Hoeffding bounds to higher-degree polynomials; and, hardness for approximation algorithms.