Communication-Space Tradeoffs for Unrestricted Protocols

From MaRDI portal

Revision as of 19:37, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4302289

Jump to:navigation, search

DOI10.1137/S0097539791196883zbMath0809.68078MaRDI QIDQ4302289

P. Y. Yan, Martin Tompa, P. W. Beame

Publication date: 14 August 1994

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

zbMATH Keywords

communication complexity universal family of hash functions communicating Boolean branching programs communicating branching programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Distributed algorithms (68W15)

Related Items (2)

Efficient simulation of synchronous systems by multi-speed systems ⋮ The computational complexity of universal hashing

This page was built for publication: Communication-Space Tradeoffs for Unrestricted Protocols

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4302289&oldid=18240574"