The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions
From MaRDI portal
Publication:3012817
DOI10.1007/978-3-642-22006-7_28zbMath1323.94189MaRDI QIDQ3012817
No author found.
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_28
94A17: Measures of information, entropy
Related Items
Upper bounds on Fourier entropy, A note on the entropy/influence conjecture, Towards a proof of the Fourier-entropy conjecture?, Upper Bounds on Fourier Entropy
Cites Work
- The average sensitivity of bounded-depth circuits
- On Russo's approximate zero-one law
- An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution
- Equivalence classes of periodic sequences
- Improved Pseudorandom Generators for Depth 2 Circuits
- Logarithmic Sobolev Inequalities
- Every monotone graph property has a sharp threshold
- Optimal Binary Coding of Ordered Numbers
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices
- Some Results for Discrete Unimodality
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item