Towards a Proof of the Fourier-Entropy Conjecture?
- 1 August 2020
- journal article
- research article
- Published by Springer Nature in Geometric and Functional Analysis
- Vol. 30 (4) , 1097-1138
Abstract
No abstract availableKeywords
All Related Versions
This publication has 27 references indexed in Scilit:
- A structure theorem for Boolean functions with small total influencesAnnals of Mathematics, 2012
- Intersecting Families are Essentially Contained in JuntasCombinatorics, Probability and Computing, 2009
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?SIAM Journal on Computing, 2007
- On the hardness of approximating vertex coverAnnals of Mathematics, 2005
- On the distribution of the fourier spectrum of Boolean functionsIsrael Journal of Mathematics, 2002
- An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform DistributionJournal of Computer and System Sciences, 1997
- Learning Decision Trees Using the Fourier SpectrumSIAM Journal on Computing, 1993
- Inequalities in Fourier AnalysisAnnals of Mathematics, 1975
- Logarithmic Sobolev InequalitiesAmerican Journal of Mathematics, 1975
- Étude des coefficients de Fourier des fonctions deAnnales de l'institut Fourier, 1970