Sep 26, 2018 · We study what FEI implies about the structure of polynomials that 1/3-approximate a Boolean function.

Sep 1, 2021 · The Fourier Entropy-influence (FEI) conjecture of Friedgut and Kalai [28] seeks to relate two fundamental measures associated with the Fourier distribution.

We believe that these improved bounds on min-entropy of the Fourier distribution give a better understanding of. Fourier coefficients of Boolean functions, and ...

is the standard Shannon entropy. We believe that these improved bounds on min-entropy of the Fourier distribution give a better understanding of Fourier ...

Improved bounds on Fourier entropy and Min-entropy. The current best upper bound, proven by Bourgain and Kalai [11], is cε(log n)−2+ε for. 108 every ε > 0 ...

We believe that these improved bounds on min-entropy of the Fourier distribution give a better understanding of Fourier coefficients of Boolean functions, and ...

Abstract. Given a Boolean function f : {−1, 1}n → {−1, 1}, define the Fourier distribution to be the distribution on subsets of [n], where each S ⊆ [n] is ...

Improved bounds on Fourier entropy and Min-entropy ... We believe that these improved bounds on min-entropy of the Fourier distribution give a better.

Improved bounds on Fourier entropy and Min-entropy. Arunachalam, S.; Chakraborty, S.; Koucký, M.; Saurabh, N.; de Wolf, R. DOI. 10.4230/LIPIcs.STACS.2020.45.

Dec 1, 2021 · Improved Bounds on Fourier Entropy and Min-entropy for ACM TOCT by Srinivasan Arunachalam et al.