Partition Arguments in Multiparty Communication Complexity

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.

[1]  Richard J. Lipton,et al.  Multi-party protocols , 1983, STOC.

[2]  Subhash Khot,et al.  Near-optimal lower bounds on the multi-party communication complexity of set disjointness , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[3]  José D. P. Rolim,et al.  Lower Bounds on the Multiparty Communication Complexity , 1998, J. Comput. Syst. Sci..

[4]  Ravi Kumar,et al.  Approximate counting of inversions in a data stream , 2002, STOC '02.

[5]  Avi Wigderson,et al.  Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..

[6]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[7]  Noga Alon,et al.  The Space Complexity of Approximating the Frequency Moments , 1999 .

[8]  Moni Naor,et al.  Amortized Communication Complexity , 1995, SIAM J. Comput..

[9]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[10]  Martin Dietzfelbinger,et al.  A Comparison of Two Lower-Bound Methods for Communication Complexity , 1994, Theor. Comput. Sci..

[11]  Danny Dolev,et al.  Determinism vs. Nondeterminism in Multiparty Communication Complexity , 1992, SIAM J. Comput..

[12]  Danny Dolev,et al.  Multiparty communication complexity , 1989, 30th Annual Symposium on Foundations of Computer Science.

[13]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[14]  Ran Raz,et al.  On the “log rank”-conjecture in communication complexity , 1995, Comb..

[15]  Johan Håstad Tensor Rank is NP-Complete , 1990, J. Algorithms.

[16]  André Gronemeier,et al.  Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness , 2009, STACS.

[17]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[18]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

[19]  Pavol Duris,et al.  Multiparty communication complexity and very hard functions , 2004, Inf. Comput..

[20]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[21]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[22]  Richard J. Lipton,et al.  Lower bounds for VLSI , 1981, STOC '81.