25th Annual Symposium onFoundations of Computer Science, 1984. (1984)
Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
R. Paturi , The Pennsylvania State University
We study (unbounded error) probabilistic communication complexity. Our new results include -one way and two complexities differ by at most 1 - certain functions like equality and the verification of Hamming distance have upper bounds that are considerably better than their counterparts in deterministic, nondeterministic, or bounded error probabilistic model - there exists a function which requires /spl Omega/(logn) information transfer. As an application, we prove that a certain language requires /spl Omega/(nlogn) time to be recognized by a 1-tape (unbounded error) probabilistic Turing machine. This bound is optimal. (Previous lower bound results [Yao 1] require acceptance by bounded error computation. We believe that this is the first nontrivial lower bound on the time required by unrestricted probabilistic Turing machines.
R. Paturi and J. Simon, "Probabilistic Communication Complexity," 25th Annual Symposium onFoundations of Computer Science, 1984.(FOCS), Singer Island, FL, 1984, pp. 118-126.