A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Partition Arguments in Multiparty Communication Complexity
[chapter]

2009
*
Lecture Notes in Computer Science
*

Consider the "Number in Hand" multiparty communication complexity model, where k players holding inputs x 1 , . . . , x k ∈ {0, 1} n communicate to compute the value f (x 1 , . . . , x k ) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find a lower bound for the induced two-party communication complexity problem. In this paper, we

doi:10.1007/978-3-642-02927-1_33
fatcat:i2igbsjri5bpvk2ihf6xjysiwe