## The unbounded-error communication complexity of symmetric functions (2008)

### Cached

### Download Links

- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | In Proc. of the 49th Symposium on Foundations of Computer Science (FOCS |

Citations: | 16 - 9 self |

### BibTeX

@INPROCEEDINGS{Sherstov08theunbounded-error,

author = {Alexander A. Sherstov},

title = {The unbounded-error communication complexity of symmetric functions},

booktitle = {In Proc. of the 49th Symposium on Foundations of Computer Science (FOCS},

year = {2008},

pages = {384--393}

}

### OpenURL

### Abstract

We prove an essentially tight lower bound on the unbounded-error communication complexity of every symmetric function, i.e., f (x, y) = D(|x ∧ y|), where D: {0, 1,..., n} → {0, 1} is a given predicate and x, y range over {0, 1} n. Specifically, we show that the communication complexity of f is between �(k / log5 n) and �(k log n), where k is the number of value changes of D in {0, 1,..., n}. The unbounded-error model is the most powerful of the basic models of communication (both classical and quantum), and proving lower bounds in it is a considerable challenge. The only previous nontrivial lower bounds for explicit functions in this model appear in the groundbreaking work of Forster (2001) and its extensions. Our proof is built around two novel ideas. First, we show that a given predicate D gives rise to a rapidly mixing random walk on Zn 2, which allows us to reduce the problem to communication lower bounds for “typical” predicates. Second, we use Paturi’s approximation lower bounds (1992), suitably generalized here to clusters of real nodes in [0, n] and interpreted in their dual form, to prove that a typical predicate behaves analogous to PARITY with respect to a smooth distribution on the inputs.