Add to ORKGThis 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
This paper applies methods from harmonic analysis to prove some general theorems on boolean function...
Abstract: Let f: {−1,1}n → R be a real function on the hypercube, given by its discrete Fourier expa...
Provides the first comprehensive, unified presentation of the structural, algorithmic and applied as...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This thesis will focus on the study of Boolean functions. In point of fact, they can be represented ...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
We survey learning algorithms that are based on the Fourier Transform representation. In many cases ...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
We present a range of new results for testing properties of Boolean functions that are defined in te...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
Boolean Function Analysis, the study of functions on the Boolean cube {0,1}^n, forms an essential pa...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
AbstractIn this note we describe Boolean functions f(x1,x2,…,xn) whose Fourier coefficients are conc...
This paper applies methods from harmonic analysis to prove some general theorems on boolean function...
Abstract: Let f: {−1,1}n → R be a real function on the hypercube, given by its discrete Fourier expa...
Provides the first comprehensive, unified presentation of the structural, algorithmic and applied as...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This article accompanies a tutorial talk given at the 40th ACM STOC conference. In it, we give a bri...
This thesis will focus on the study of Boolean functions. In point of fact, they can be represented ...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
We survey learning algorithms that are based on the Fourier Transform representation. In many cases ...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
We present a range of new results for testing properties of Boolean functions that are defined in te...
The topic of discrete Fourier analysis has been extensively studied in recent decades. It plays an i...
Boolean Function Analysis, the study of functions on the Boolean cube {0,1}^n, forms an essential pa...
Abstract. We present a range of new results for testing properties of Boolean functions that are def...
In this paper we establish some properties about Boolean functions that allow us to relate their deg...
AbstractIn this note we describe Boolean functions f(x1,x2,…,xn) whose Fourier coefficients are conc...
This paper applies methods from harmonic analysis to prove some general theorems on boolean function...
Abstract: Let f: {−1,1}n → R be a real function on the hypercube, given by its discrete Fourier expa...
Provides the first comprehensive, unified presentation of the structural, algorithmic and applied as...