Date of Original Version
Response or Comment
Abstract or Description
This 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.
Proceedings of the 40th Annual ACM Symposium on theory of Computing . STOC '08., 569- 578.