Communication Complexity of Computing the Hamming Distance

DOI10.1137/0215065zbMath0619.68045OpenAlexW2028750115MaRDI QIDQ3756524

No author found.

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0215065

zbMATH Keywords

Hamming distancecommunication complexityrandomized protocolcombinatorial extremal problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Related Items

Deterministic communication complexity of set intersection, Communication complexity of convex optimization, A general 4-words inequality with consequences for 2-way communication complexity, Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems, A two-family extremal problem in Hamming space, Still another rank determination of set intersection matrices with an application in communication complexity