Vijay Visavaliya

Learn More
In this paper, we prove that most of the boolean functions, f : {−1, 1} n → {−1, 1} satisfy the Fourier Entropy Influence (FEI) Conjecture due to Friedgut and Kalai (Proc. AMS'96)[1]. The conjecture says that the Entropy of a boolean function is at most a constant times the Influence of the function. The conjecture has been proven for families of functions(More)
  • 1