Probabilistic Communication Complexity

R. Paturi, J. Simon
25th Annual Symposium onFoundations of Computer Science, 1984.  
W e study (unbounded error) probabilistic communication complexity. Our new results include Po, and second argument, X i l is known to Pi. In order to compute f , Po, and P , communicate one way a d two way complexities differ by a t most 1 certain functions like equality and the verification of Hamming distance have upper bounds that are considerably PO, and Pi have unlimited local computing better than their counterparts in deterministic, nondeterministic, or power, and the ability to realize
more » ... an arbitrary bounded error probabilistic model I18 0272-5428/84/0000/0118$01.00 @ 1984 IEEE protocol (p oulputs the bit b ( b = O or 1) if the probability of events whose result is b is 1 Formally, t i function (p(z,a,p) is the sage B will be its input and sequence of the property is finite and C y ( z , u , B ) = 1 . B perty, a can again be messages which col. Let q~ be a
doi:10.1109/sfcs.1984.715908 dblp:conf/focs/PaturiS84 fatcat:m3en7zxpxjch3oy3mmhcbs54em