𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Communication complexity
✍ Christos H. Papadimitriou; Michael Sipser 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 613 KB
Complexity and hierarchy: A level rule
✍ Gad Yagil 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 515 KB

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

A hierarchy for nondeterministic time co
✍ Stephen A. Cook 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 515 KB

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.

Quantum communication and complexity
✍ Ronald de Wolf 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 182 KB

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