29908 search results - page 10 / 5982 » On the complexity of communication complexity |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regim...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
144
click to vote
CC
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
102
click to vote
COCO
2009
Springer
15 years 6 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...