Communication complexity of sum-type functions invariant under translation

DOI10.1006/INCO.1995.1012zbMath0828.68089OpenAlexW2000537066MaRDI QIDQ1891145

Ulrich Tamm

Publication date: 28 May 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1012

zbMATH Keywords

communication complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication theory (94A05)

Related Items (3)

A Black Box for Online Approximate Pattern Matching ⋮ Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions ⋮ Rank formulas for certain products of matrices

This page was built for publication: Communication complexity of sum-type functions invariant under translation