COMMUNICATION COMPLEXITY IN A 3-COMPUTER MODEL

Authors
AMBAINIS A
Citation
A. Ambainis, COMMUNICATION COMPLEXITY IN A 3-COMPUTER MODEL, Algorithmica, 16(3), 1996, pp. 298-301
Citations number
3
Categorie Soggetti
Computer Sciences",Mathematics,Mathematics,"Computer Science Software Graphycs Programming
Journal title
Algorithmica → ACNP
ISSN journal
01784617
Volume
16
Issue
3
Year of publication
1996
Pages
298 - 301
Database
ISI
SICI code
0178-4617(1996)16:3<298:CCIA3M>2.0.ZU;2-U
Abstract
It is proved that the probabilistic communication complexity of the id entity function in a 3-computer model is O(root n).