𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Communication complexity

✍ Scribed by Christos H. Papadimitriou; Michael Sipser


Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
613 KB
Volume
28
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Communication complexity hierarchy
✍ Juraj Hromkovič πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 445 KB
Communication complexity in lattices
✍ Rudolf Ahlswede; Ning Cai; Ulrich Tamm πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 467 KB
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

Communication complexity of convex optim
✍ John N Tsitsiklis; Zhi-Quan Luo πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 692 KB

We consider a situation where each of two processors has access to a different convex functionA, i = 1,2, defined on a common bounded domain. The processors are to exchange a number of binary messages, according to some protocol, until they find a point in the domain at which f, + h is minimized, wi

Matrix rank and communication complexity
✍ Bruno Codenotti; Gianna Del Corso; Giovanni Manzini πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 76 KB

The rank of a matrix seems to play a role in the context of communication complexity, a framework developed to analyze basic communication requirements of computational problems. We present some issues and open problems arising in this area, and put forward a number of research subjects in linear al