𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The unbounded-error communication complexity of symmetric functions

✍ Scribed by Alexander A. Sherstov

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
370 KB
Volume
31
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A linear lower bound on the unbounded er
A linear lower bound on the unbounded error probabilistic communication complexity
✍ JΓΌrgen Forster πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 187 KB

The main mathematical result of this paper may be stated as follows: Given a matrix MAfΓ€1; 1g nΓ‚n and any matrix MAR nΓ‚n such that signΓ° Mi;j Þ ΒΌ M i;j for all i; j; then rankΓ° MÞXn=jjMjj: Here jjMjj denotes the spectral norm of the matrix M: This implies a general lower bound on the complexity of