Communication Complexity of Computing the Hamming Distance
From MaRDI portal
Publication:3756524
Recommendations
- The communication complexity of the Hamming distance problem
- Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems
- The information complexity of Hamming distance
- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
- The communication complexity of gap Hamming distance
Cited in
(17)- Communication complexity of statistical distance
- Communication complexity of statistical distance
- One-sided error communication complexity of gap Hamming distance
- Communication complexity of convex optimization
- The communication complexity of the Hamming distance problem
- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
- The information complexity of Hamming distance
- A general 4-words inequality with consequences for 2-way communication complexity
- The one-way communication complexity of Hamming distance
- Still another rank determination of set intersection matrices with an application in communication complexity
- Communication complexity of sum-type functions invariant under translation
- Lower bounds on the deterministic and quantum communication complexity of Hamming-distance problems
- A two-family extremal problem in Hamming space
- scientific article; zbMATH DE number 1445304 (Why is no real title available?)
- scientific article; zbMATH DE number 2162205 (Why is no real title available?)
- Deterministic communication complexity of set intersection
- The communication complexity of gap Hamming distance
This page was built for publication: Communication Complexity of Computing the Hamming Distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756524)