𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A time complexity lower bound for adaptive mutual exclusion

✍ Scribed by Yong-Jik Kim; James H. Anderson

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
676 KB
Volume
24
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A comparison of two lower-bound methods
A comparison of two lower-bound methods for communication complexity
✍ Martin Dietzfelbinger; Juraj Hromkovič; Georg Schnitger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 835 KB

The methods "Rank" and "Fooling Set" for proving lower bounds on the deterministic communication complexity of Boolean functions are compared. The main results are as follows. (i) For almost all Boolean functions of 2n variables the Rank method provides the lower bound n on communication complexity