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
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
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
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