Anticoncentration and the Exact Gap-Hamming Problem
From MaRDI portal
Recommendations
Cites work
- A near-optimal algorithm for estimating the entropy of a stream
- A sharp inverse Littlewood-Offord theorem
- Additive combinatorics
- Better Gap-Hamming Lower Bounds via Better Round Elimination
- Communication Complexity
- Communication Complexity
- Concentration of measure and isoperimetric inequalities in product spaces
- Estimates for the concentration function of combinatorial number theory and probability
- scientific article; zbMATH DE number 6292622 (Why is no real title available?)
- scientific article; zbMATH DE number 3232871 (Why is no real title available?)
- scientific article; zbMATH DE number 3099315 (Why is no real title available?)
- Inverse Littlewood-Offord theorems and the condition number of random discrete matrices
- On a lemma of Littlewood and Offord
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On products of sets in a locally compact group
- On the Probability That a Random ± 1-Matrix Is Singular
- Singularity of discrete random matrices
- Solution of the Littlewood-Offord problem in high dimensions
- Summenmengen in lokalkompakten abelschen Gruppen
- The communication complexity of gap Hamming distance
- The computational complexity of linear optics
- The one-way communication complexity of Hamming distance
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- Über ein Problem von Erdös und Moser
This page was built for publication: Anticoncentration and the Exact Gap-Hamming Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074948)
