The Communication Complexity of Pointer Chasing

We study the k-round two-party communication complexity of the pointer chasing problem for fixed k. C. Damm, S. Jukna and J. Sgall (1998, Comput. Complexity7, 109?127) showed an upper bound of O(nlog(k?1)n) for this problem. We prove a matching lower bound; this improves the lower bound of ?(n) shown by N. Nisan and A. Widgerson (1993, SIAM J. Comput.22, 211?219), and yields a corresponding improvement in the hierarchy results derived by them and by H. Klauck (1998, in “Proceeding of the Thirteenth Annual IEEE Conference on Computational Complexity,” pp. 141?152) for bounded-depth monotone circuits. We consider the bit version of this problem, and show upper and lower bounds. This implies that there is an abrupt jump in complexity, from linear to superlinear, when the number of rounds is reduced to k/2 or less. We also consider the s-paths version (originally studied by H. Klauck) and show an upper bound. The lower bounds are based on arguments using entropy. One of the main contributions of this work is a transfer lemma for distributions with high entropy; this should be of independent interest.

[1]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[2]  Zvi Galil,et al.  Lower Bounds on Communication Complexity , 1987, Inf. Comput..

[3]  Rüdiger Reischuk,et al.  On different modes of communication , 1988, STOC '88.

[4]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[5]  Jaikumar Radhakrishnan,et al.  The communication complexity of pointer chasing: applications of entropy and sampling , 1999, STOC '99.

[6]  Juraj Hromkovic,et al.  Nondeterministic communication with a limited number of advice bits , 1996, STOC '96.

[7]  Mihalis Yannakakis,et al.  On monotone formulae with restricted depth , 1984, STOC '84.

[8]  Noam Nisan,et al.  Rounds in Communication Complexity Revisited , 1993, SIAM J. Comput..

[9]  Hartmut Klauck,et al.  Lower bounds for computation with limited nondeterminism , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[10]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[11]  Jirí Sgall,et al.  Some bounds on multiparty communication complexity of pointer jumping , 1998, computational complexity.

[12]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

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