Some Topics in Analysis of Boolean Functions
journal contributionposted on 01.01.1968, 00:00 by Ryan O'Donnell
Any type of content formally published in an academic journal, usually following a peer-review process.
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.