Communication-space tradeoffs for unrestricted protocols

Authors:
P. Beame;M. Tompa;P. Yan
Affiliations:
Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA;Dept. of Comput. Sci.&Eng., Washington Univ., Seattle, WA, USA;-
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 1

Space-bounded communication complexity

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Communicating branching programs are introduced, and a general technique for demonstrating communication-space tradeoffs for pairs of communicating branching programs is developed. The technique is used to prove communication-space tradeoffs for any pair of communicating branching programs that hashes according to a universal family of hash functions. Other tradeoffs follow from this result. For example any pair of communicating Boolean branching programs that computes matrix-vector products over GF(2) requires communication-space product Omega (n/sup 2/). These are the first examples of communication-space tradeoffs on a completely general model of communicating processes.