Probabilistic communication complexity over the reals - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computational Complexity Année : 2008

Probabilistic communication complexity over the reals

Résumé

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 its recognizing does not exceed 4. A polyhedron and a union of hyperplanes are constructed in $\RR^{2n}$ for which a lower bound $n/2$ on the probabilistic communication complexity of recognizing each is proved. As a consequence this bound holds also for the EMPTINESS and the KNAPSACK problems.
Fichier principal
Vignette du fichier
communication_journal.pdf (153.14 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00179245 , version 1 (15-10-2007)

Identifiants

Citer

Dima Grigoriev. Probabilistic communication complexity over the reals. Computational Complexity, 2008, 17 (4), pp.536-548. ⟨10.1007/s00037-008-0255-z⟩. ⟨hal-00179245⟩
282 Consultations
110 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More