Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Ryan O’Donnell (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: