Tight Bounds for Set Disjointness in the Message Passing Model

In a multiparty message-passing model of communication, there are k players. Each player has a private input, and they communicate by sending messages to one another over private channels. While this model has been used extensively in distributed computing and in secure multiparty computation, lower bounds on communication complexity in this model and related models have been somewhat scarce. In recent work [25], [29], [30], strong lower bounds of the form Ω(n·k) were obtained for several functions in the message-passing model; however, a lower bound on the classical set disjointness problem remained elusive. In this paper, we prove a tight lower bound of Ω(n · k) for the set disjointness problem in the message passing model. Our bound is obtained by developing information complexity tools for the message-passing model and proving an information complexity lower bound for set disjointness.

[1]  David P. Woodruff,et al.  On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation , 2012, APPROX-RANDOM.

[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]  Toniann Pitassi,et al.  The story of set disjointness , 2010, SIGA.

[4]  A. Razborov.  Communication Complexity , 2011 .

[5]  Graham Cormode,et al.  Sketching Streams Through the Net: Distributed Approximate Query Tracking , 2005, VLDB.

[6]  Roger Wattenhofer,et al.  Networks cannot compute their diameter in sublinear time , 2012, SODA.

[7]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[8]  Alexander A. Sherstov.  The multiparty communication complexity of set disjointness , 2012, STOC '12.

[9]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[10]  Fabian Kuhn,et al.  The Complexity of Data Aggregation in Directed Networks , 2011, DISC.

[11]  Boaz Patt-Shamir.  A note on efficient aggregate queries in sensor networks , 2007, Theor. Comput. Sci..

[12]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[13]  Andrew Chi-Chih Yao,et al.  Informational complexity and the direct sum problem for simultaneous message complexity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[14]  Richard Beigel,et al.  On ACC (circuit complexity) , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[15]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[16]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[17]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[18]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[19]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[20]  Avi Wigderson,et al.  Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.

[21]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[22]  David P. Woodruff,et al.  Tight bounds for distributed functional monitoring , 2011, STOC '12.

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

[24]  Leslie Lamport,et al.  The part-time parliament , 1998, TOCS.

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

[26]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[27]  Mark Braverman,et al.  From information to exact communication , 2013, STOC '13.

[28]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[29]  Alexander A. Sherstov.  Communication Lower Bounds Using Directional Derivatives , 2014, JACM.

[30]  T. S. Jayram.  Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND , 2009, APPROX-RANDOM.

[31]  Joan Feigenbaum,et al.  Approximate privacy: foundations and quantification (extended abstract) , 2010, EC '10.

[32]  Christopher Olston,et al.  Finding (recently) frequent items in distributed data streams , 2005, 21st International Conference on Data Engineering (ICDE'05).

[33]  Arkadev Chattopadhyay,et al.  Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..

[34]  Troy Lee,et al.  Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model , 2008, Computational Complexity Conference.

[35]  David P. Woodruff,et al.  When Distributed Computation does not Help , 2013, ArXiv.

[36]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[37]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[38]  Morteza Zadimoghaddam,et al.  How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) , 2010, ICALP.

[39]  Roberto Di Pietro,et al.  Gossip-based aggregate computation: computing faster with non address-oblivious schemes , 2008, PODC '08.

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

[41]  Mark Braverman,et al.  Information Equals Amortized Communication , 2011, IEEE Transactions on Information Theory.

[42]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[43]  Ravi Kumar,et al.  An information statistics approach to data stream and communication complexity , 2004, J. Comput. Syst. Sci..

[44]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[45]  Toniann Pitassi,et al.  The Hardness of Being Private , 2012, 2012 IEEE 27th Conference on Computational Complexity.

[46]  Richard Beigel,et al.  On ACC , 1994, computational complexity.

[47]  Hagit Attiya,et al.  Sharing memory robustly in message-passing systems , 1990, PODC '90.