Communication complexity hierarchy
✍ Scribed by Juraj Hromkovič
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 445 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
n this article, the connection between structural complexity and hierarchical organization is examined. The following quantitative rule, connecting complexities evaluated at different hierarchical levels, is offered: C A/C is the complexity of an A-level structure evaluated in terms of its C-sublev
We prove the following theorem in this paper: For any real numbers rl, r2, 1 ~ rl ~ r2, there is a set .4 of strings which has nondeterministic time complexity n\*2, but not nondeterministic time complexity n\*l. The computing devices are nondeterministic multitape Turing machines.
In the setting of communication complexity, two distributed parties want to compute a function depending on both their inputs, using as little communication as possible. The required communication can sometimes be signiÿcantly lowered if we allow the parties the use of quantum communication. We surv