Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of Algorithms
Private vs. common random bits in communication complexity
Information Processing Letters
Determinism vs. nondeterminism in multiparty communication complexity
SIAM Journal on Computing
Amortized Communication Complexity
SIAM Journal on Computing
A comparison of two lower-bound methods for communication complexity
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Communication complexity
Lower bounds on the multiparty communication complexity
Journal of Computer and System Sciences
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Multiparty communication complexity and very hard functions
Information and Computation
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Multiparty communication complexity
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Communication complexity: from two-party to multiparty
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Hi-index | 0.00 |
Consider the "Number in Hand" multiparty communication complexity model, where k players P 1 ,...,P k holding inputs $x_1,\ldots,x_k\in{0, 1}^n$ (respectively) communicate in order to compute the value f (x 1 ,...,x k ). 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 study the power of the partition arguments method. Our two main results are very different in nature: (i) For randomized communication complexity we show that partition arguments may be exponentially far from the true communication complexity. Specifically, we prove that there exists a 3-argument function f whose communication complexity is *** (n ) but partition arguments can only yield an *** (log n ) lower bound. The same holds for nondeterministic communication complexity. (ii) For deterministic communication complexity, we prove that finding significant gaps, between the true communication complexity and the best lower bound that can be obtained via partition arguments, would imply progress on (a generalized version of) the "log rank conjecture" of communication complexity.