On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model

We study the communication complexity of linear algebraic problems over finite fields in the multi-player message passing model, proving a number of tight lower bounds. We give a general framework for reducing these multi-player problems to their two-player counterparts, showing that the randomized s-player communication complexity of these problems is at least s times the randomized two-player communication complexity. Provided the problem has a certain amount of algebraic symmetry, we can show the hardest input distribution is a symmetric distribution, and therefore apply a recent multi-player lower bound technique of Phillips et al. Further, we give new two-player lower bounds for a number of these problems. In particular, our optimal lower bound for the two-player version of the matrix rank problem resolves an open question of Sun and Wang.

[1]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2]  David P. Woodruff,et al.  Numerical linear algebra in the streaming model , 2009, STOC '09.

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

[4]  Shengyu Zhang,et al.  The communication complexity of the Hamming distance problem , 2006, Inf. Process. Lett..

[5]  Eyal Kushilevitz,et al.  Communication Complexity: Index of Notation , 1996 .

[6]  Alan M. Frieze,et al.  Fast monte-carlo algorithms for finding low-rank approximations , 2004, JACM.

[7]  Kent E. Morrison.  Integer sequences and matrices over finite fields , 2006 .

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

[9]  A. S.  The Pattern Matrix Method for Lower Bounds on Quantum Communication ∗ , 2007 .

[10]  Georg Schnitger,et al.  Communication complexity of matrix computation over finite fields , 1995, Mathematical systems theory.

[11]  Adi Shraibman,et al.  Lower bounds in communication complexity based on factorization norms , 2009 .

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

[13]  Mark Braverman,et al.  Tight Bounds for Set Disjointness in the Message Passing Model , 2013, ArXiv.

[14]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[15]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[16]  Graham Cormode,et al.  Algorithms for distributed functional monitoring , 2008, SODA '08.

[17]  Alexander A. Sherstov.  Strong Direct Product Theorems for Quantum Communication and Query Complexity , 2012, SIAM J. Comput..

[18]  Venkatesan Guruswami,et al.  Superlinear Lower Bounds for Multipass Graph Processing , 2013, Computational Complexity Conference.

[19]  David P. Woodruff,et al.  When distributed computation is communication expensive , 2013, Distributed Computing.

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

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

[22]  Qin Zhang,et al.  Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy , 2011, SIAM J. Comput..

[23]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[25]  Xi Chen,et al.  How to compress interactive communication , 2010, STOC '10.

[26]  John N. Tsitsiklis,et al.  On the communication complexity of distributed algebraic computation , 1993, JACM.

[27]  Hartmut Klauck,et al.  The Partition Bound for Classical Communication Complexity and Query Complexity , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.

[28]  Troy Lee,et al.  Lower Bounds in Communication Complexity , 2009, Found. Trends Theor. Comput. Sci..

[29]  Peter Bro Miltersen,et al.  On data structures and asymmetric communication complexity , 1994, STOC '95.

[30]  Alan M. Frieze,et al.  Fast Monte-Carlo algorithms for finding low-rank approximations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[31]  Alexander A. Sherstov.  The pattern matrix method for lower bounds on quantum communication , 2008, STOC '08.

[32]  Wei Yu,et al.  The Relationship between Inner Product and Counting Cycles , 2012, LATIN.

[33]  Xiaoming Sun,et al.  Randomized Communication Complexity for Linear Algebra Problems over Finite Fields , 2012, STACS.

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

[35]  Iordanis Kerenidis,et al.  Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[36]  Iordanis Kerenidis,et al.  Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications , 2012, SIAM J. Comput..

[37]  David P. Woodruff,et al.  An Optimal Lower Bound for Distinct Elements in the Message Passing Model , 2014, SODA.

[38]  Tamás Sarlós,et al.  Improved Approximation Algorithms for Large Matrices via Random Projections , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[39]  Yaoyun Shi,et al.  Quantum communication complexity of block-composed functions , 2007, Quantum Inf. Comput..

[40]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[41]  Xi Chen,et al.  How to Compress Interactive Communication , 2013, SIAM J. Comput..