Two-way communication complexity of sum-type functions for one processor to be informed
From MaRDI portal
Publication:1897981
zbMath0828.94005MaRDI QIDQ1897981
Publication date: 17 September 1995
Published in: Problems of Information Transmission (Search for Journal in Brave)
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Communication theory (94A05)
Related Items (2)
Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions ⋮ Still another rank determination of set intersection matrices with an application in communication complexity
This page was built for publication: Two-way communication complexity of sum-type functions for one processor to be informed
