๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The communication complexity for decentralized evaluation of functions

โœ Scribed by Shyan-Ming Yuan


Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
491 KB
Volume
35
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The Communication Complexity of Pointer
โœ Stephen J. Ponzio; Jaikumar Radhakrishnan; S. Venkatesh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 253 KB

We study the k-round two-party communication complexity of the pointer chasing problem for fixed k. C. Damm, S. Jukna and J. Sgall (1998, Comput. Complexity 7, 109 127) showed an upper bound of O(n log (k&1) n) for this problem. We prove a matching lower bound; this improves the lower bound of 0(n)