Communication-Space Tradeoffs for Unrestricted Protocols

Paul Beame, Martin Tompa, Peiyuan Yan
1994 SIAM journal on computing (Print)  
This paper introduces communicating branching programs and develops a general technique for demonstrating communication-space tradeoffs for pairs ofcommunicating branching programs. This technique is then 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. As an example, any pair of communicating Boolean branching programs that computes matrix-vector
more » ... tes matrix-vector products over GF(2) requires communication-space product f2 (n2), provided the space used is o(n / log n). These are the first examples of communication-space tradeoffs on a completely general model of communicating processes.
doi:10.1137/s0097539791196883 fatcat:sy5mayfupnf3hm25aljjwr35tq