58 search results - page 2 / 12 » On Rank vs. Communication Complexity |
COCO
2001
Springer
13 years 9 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
PIMRC
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Recently M¨uller et al. (IEEE J. Select. Areas Commun. 2008) used asymptotic methods from statistical physics to analyze non-linear vector precoding for MIMO broadcast ...
CTRSA
2006
Springer
13 years 9 months ago
2006
Springer
In this work, we initiate the study of realizing a ranking functionality (m1,
SIGECOM
2005
ACM
13 years 11 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...