Geometric arguments yield better bounds for threshold circuits and distributed computing
Matthias Krause · 2002
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.>