Abstract.
Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound 2n on the communication complexity of recognizing the 2n-dimensional orthant, on the other hand the probabilistic communication complexity of recognizing it does not exceed 4. A polyhedron and a union of hyperplanes are constructed in \(\mathbb{R}^{2n}\) for which a lower bound n on the probabilistic communication complexity of recognizing each is proved. As a consequence this bound holds also for the EMPTINESS and the KNAPSACK problems.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received 11 May 2006
Rights and permissions
About this article
Cite this article
Grigoriev, D. Probabilistic Communication Complexity Over The Reals. comput. complex. 17, 536–548 (2008). https://doi.org/10.1007/s00037-008-0255-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-008-0255-z