Probabilistic Communication Complexity (Preliminary Version)

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.

[1]  R. Buck.  Partition of Space , 1943 .

[2]  J. Milnor.  On the Betti numbers of real varieties , 1964 .

[3]  T. Zaslavsky.  Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[4]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[5]  Andrew C Yao.  A lower bound to palindrome recognition by probabilistic Turing machines , 1977 .

[6]  P. Delsarte.  Hahn Polynomials, Discrete Harmonics, and t-Designs , 1978 .

[7]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[8]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[9]  J. Lawrence.  Lopsided sets and orthant-intersection by convex sets , 1983 .

[10]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Viktor K. Prasanna,et al.  Information Transfer under Different Sets of Protocols , 1984, SIAM J. Comput..

[12]  Zvi Galil,et al.  Lower bounds on communication complexity , 1984, STOC '84.

[13]  Umesh V. Vazirani.  Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources , 1985, STOC '85.

[14]  Vojtech Rödl,et al.  Geometrical realization of set systems and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[15]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).