A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Probabilistic Communication Complexity

*
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

doi:10.1109/sfcs.1984.715908
dblp:conf/focs/PaturiS84
fatcat:m3en7zxpxjch3oy3mmhcbs54em