A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Composition Theorem for the Fourier Entropy-Influence Conjecture
[chapter]
2013
Lecture Notes in Computer Science
The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that H[f ] ≤ C · Inf [f ] holds for every Boolean function f , where H[f ] denotes the spectral entropy of f , Inf [f ] is its total influence, and C > 0 is a universal constant. Despite significant interest in the conjecture it has only been shown to hold for a few classes of Boolean functions. Our main result is a composition theorem
doi:10.1007/978-3-642-39206-1_66
fatcat:yhbxrg4fr5d5dfjscfrvl4v34i