A characterization of average case communication complexity
Information Processing Letters
Multiparty communication complexity of vector---valued and sum---type functions
Information Theory, Combinatorics, and Search Theory
Bibliography of publications by Rudolf Ahlswede
Information Theory, Combinatorics, and Search Theory
| Hi-index | 754.84 |
New upper and lower bounds on the two-way communication complexity of abstract functions g:ℋ×𝒴→𝒵 give tight bounds, when applied to vector-valued functions fn(f1 ,...,fn):ℋu×𝒴n →𝒵n, if the alphabets are small. For the set-intersection function, an optimal protocol is presented. It is based on a simple new idea applicable also to abstract functions. The two-way communication complexities of all other Boolean functions are also determined. The results are extended to meets in abstract lattices and to a probabilistic model