Deterministic communication complexity of set intersection

DOI10.1016/0166-218X(94)00021-5zbMath0831.68053MaRDI QIDQ1897354

Ulrich Tamm

Publication date: 13 February 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

communication complexitycommunication protocol

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication, information (94A99)

Related Items (3)

Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions ⋮ Still another rank determination of set intersection matrices with an application in communication complexity ⋮ Communication complexity in lattices

Cites Work

• Unnamed Item
• A general 4-words inequality with consequences for 2-way communication complexity
• Communication Complexity of Computing the Hamming Distance
• Lower bounds on communication complexity in distributed computer networks
• On communication complexity of vector-valued functions

This page was built for publication: Deterministic communication complexity of set intersection