Geometric arguments yield better bounds for threshold circuits and distributed computing

The computational power of two-party probabilistic communication protocols is investigated. This model generalizes the concepts of nondeterministic and conondeterministic communication protocols in a natural way. Applications of the technique are presented, and some open problems are stated.<<ETX>>

[1]  Janos Simon,et al.  Probabilistic Communication Complexity (Preliminary Version) , 1984, FOCS.

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

[3]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[4]  Richard J. Lipton,et al.  Multi-party protocols , 1983, STOC.

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

[6]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.