On the power of the congested clique model

We study the computation power of the congested clique, a model of distributed computation where n players communicate with each other over a complete network in order to compute some function of their inputs. The number of bits that can be sent on any edge in a round is bounded by a parameter b We consider two versions of the model: in the first, the players communicate by unicast, allowing them to send a different message on each of their links in one round; in the second, the players communicate by broadcast, sending one message to all their neighbors. It is known that the unicast version of the model is quite powerful; to date, no lower bounds for this model are known. In this paper we provide a partial explanation by showing that the unicast congested clique can simulate powerful classes of bounded-depth circuits, implying that even slightly super-constant lower bounds for the congested clique would give new lower bounds in circuit complexity. Moreover, under a widely-believed conjecture on matrix multiplication, the triangle detection problem, studied in [8], can be solved in O(nε) time for any ε > 0. The broadcast version of the congested clique is the well-known multi-party shared-blackboard model of communication complexity (with number-in-hand input). This version is more amenable to lower bounds, and in this paper we show that the subgraph detection problem studied in [8] requires polynomially many rounds for several classes of subgraphs. We also give upper bounds for the subgraph detection problem, and relate the hardness of triangle detection in the broadcast congested clique to the communication complexity of set disjointness in the 3-party number-on-forehead model.

[1]  Kristoffer Arnsfelt Hansen,et al.  A New Characterization of ACC0 and Probabilistic CC0 , 2009, computational complexity.

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

[3]  Kristoffer Arnsfelt Hansen,et al.  A New Characterization of ACC^0 and Probabilistic CC^0 , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[4]  Béla Bollobás,et al.  Extremal problems in graph theory , 1977, J. Graph Theory.

[5]  Michael Clausen,et al.  Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.

[6]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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

[8]  R. Shen,et al.  A new characterization of A5 , 2008 .

[9]  Amit Sahai,et al.  Secure Multi-Party Computation , 2013 .

[10]  Nathan Linial,et al.  On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels , 1993, IEEE Trans. Inf. Theory.

[11]  Boaz Patt-Shamir,et al.  MST construction in O(log log n) communication rounds , 2003, SPAA '03.

[12]  Pavel Pudlák,et al.  Bounded-depth circuits: separating wires from gates , 2005, STOC '05.

[13]  Michael Elkin,et al.  Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem , 2004, STOC '04.

[14]  Boaz Patt-Shamir,et al.  MST construction inO(log logn) communication rounds , 2003, ACM Symposium on Parallelism in Algorithms and Architectures.

[15]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1991, computational complexity.

[16]  M. Simonovits,et al.  Cycles of even length in graphs , 1974 .

[17]  Pavel Pudlák,et al.  Lower bounds for circuits with MOD_m gates , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[18]  Michael E. Saks,et al.  Size-depth trade-offs for threshold circuits , 1993, SIAM J. Comput..

[19]  Dina Katabi,et al.  Zigzag decoding: combating hidden terminals in wireless networks , 2008, SIGCOMM '08.

[20]  Alon Itai,et al.  Finding a minimum circuit in a graph , 1977, STOC '77.

[21]  Mihai Patrascu,et al.  On the possibility of faster SAT algorithms , 2010, SODA '10.

[22]  V. Sós,et al.  On a problem of K. Zarankiewicz , 1954 .

[23]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[24]  A. Razborov.  Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .

[25]  Avi Wigdersony.  N (log N) Lower Bounds on the Size of Depth 3 Threshold Circuits with and Gates at the Bottom , 1993 .

[26]  Christopher M. Hartman.  Extremal problems in graph theory , 1997 .

[27]  David Peleg,et al.  A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction , 2000, SIAM J. Comput..

[28]  Noam Nisan,et al.  Economic efficiency requires interaction , 2013, STOC.

[29]  Christoph Lenzen,et al.  Optimal deterministic routing and sorting on the congested clique , 2012, PODC '13.

[30]  Thomas Kailath,et al.  Computing with Almost Optimal Size Neural Networks , 1992, NIPS.

[31]  Miklós Simonovits,et al.  Compactness results in extremal graph theory , 1982, Comb..

[32]  Ryan Williams.  Nonuniform ACC Circuit Lower Bounds , 2014, JACM.

[33]  Nicolas Nisse,et al.  Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[34]  Alexander A. Sherstov.  SeparatingAC0 from Depth-2 Majority Circuits , 2009, SIAM J. Comput..

[35]  David Peleg,et al.  A near-tight lower bound on the time complexity of distributed MST construction , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[36]  Christoph Lenzen,et al.  "Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract) , 2012, DISC.

[37]  Avi Wigderson,et al.  Simple analysis of graph tests for linearity and PCP , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[38]  Boaz Patt-Shamir,et al.  The round complexity of distributed sorting: extended abstract , 2011, PODC '11.

[39]  Roger Wattenhofer,et al.  Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.

[40]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[41]  Ryan Williams,et al.  A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[42]  Alexander A. Sherstov.  Separating AC0 from depth-2 majority circuits , 2007, STOC '07.

[43]  Alexandros G. Dimakis,et al.  SigSag: Iterative Detection Through Soft Message-Passing , 2011, IEEE Journal of Selected Topics in Signal Processing.

[44]  Boaz Patt-Shamir,et al.  On the complexity of distributed stable matching with small messages , 2010, Distributed Computing.

[45]  Alexander A. Razborov,et al.  n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom , 1993, Information Processing Letters.

[46]  Marina Blanton,et al.  Secure Multiparty Computation , 2011, Encyclopedia of Cryptography and Security.

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

[48]  Roman Smolensky,et al.  Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.

[49]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[50]  Georg Schnitger,et al.  Parallel Computation with Threshold Functions , 1988, J. Comput. Syst. Sci..

[51]  Fabian Kuhn,et al.  Distributed Minimum Cut Approximation , 2013, DISC.

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