Abstract
We introduce the model of conservative one-way multiparty complexity and prove lower and upper bounds on the complexity of pointer jumping.
The pointer jumping function takes as its input a directed layered graph with a starting node and k layers of n nodes, and a single edge from each node to one node from the next layer. The output is the node reached by following k edges from the starting node.
In a conservative protocol Player i can see only the node reached by following the first i−1 edges and the edges on the jth layer for each j>i (compared to the general model where he sees edges of all layers except for the ith one). In a one-way protocol, each player communicates only once: first Player 1 writes a message on the blackboard, then Player 2, etc., until the last player gives the answer. The cost is the total number of bits written on the blackboard.
Our main results are the following bounds on k-party conservative one-way communication complexity of pointer jumping with k layers:
-
(1)
A lower bound of Ω(n/k 2) for any \(k = O(n^{1/3 - \varepsilon } )\). This is the first lower bound on multiparty communication complexity that works for more than log n players.
-
(2)
Matching upper and lower bounds of Θ(n log(k−1) n) for k≤log* n. No better one-way protocols are known, even if we consider non-conservative ones.
On leave from Institute of Mathematics, Vilnius, Lithuania.
This work was done at Institute of Computer Science, Hebrew University, Jerusalem, Israel, supported in part by Golda Meir Postdoctoral Fellowship.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Ambainis. Improving the unexpected: Upper bounds on communication complexity. Manuscript, 1994.
L. Babai, P. Kimmel, and S. V. Lokam. Simultaneous messages vs. communication. In Proc. of the 12th STACS, LNCS 900, pages 361–372. Springer-Verlag, 1995.
L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. J. Comput. Syst. Sci., 45:204–232, 1992.
R. Beigel and J. Tarui. On ACC. Comput. Complexity, 4:350–366, 1994.
B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener. On the power of different types of restricted branching programs. Technical Report TR94-026, Electronic Colloquium on Computational Complexity, 1994.
A. K. Chandra, M. L. Furst, and R. J. Lipton. Multi-party protocols. In Proc. of the 15th STOC, pages 94–99. ACM, 1983.
F. R. K. Chung and P. Tetali. Communication complexity and quasi-randomness. SIAM J. Disc. Math., 6(1):110–123, 1993.
C. Damm and S. Jukna. On multiparty games for pointer jumping. Forschungsbericht Nr. 95-09, Universität Trier, Mathematik/Informatik, 1995.
P. Ďuriš, Z. Galil, and G. Schnitger. Lower bounds on communication complexity. Inf. Comput., 73:1–22, 1987.
M. Grigni and M. Sipser. Monotone separation of logspace from NC 1. In Proc. of the 6th Structure in Complexity Theory, pages 294–298, IEEE, 1991.
J. Håstad and M. Goldmann. On the power of small-depth threshold circuits. Comput. Complexity, 1:113–129, 1991.
E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, to appear.
N. Nisan and A. Wigderson. Rounds in communication complexity revisited. SIAM J. Comput., 22(1):211–219, 1993.
C. Papadimitriou and M. Sipser. Communication complexity. J. Comput. Syst. Sci., 28:260–269, 1984.
P. Pudlák and V. Rödl. Modified ranks of tensors and the size of circuits. In Proc. of the 25th STOC, pages 523–531. ACM, 1993.
P. Pudlák, V. Rödl, and J. Sgall. Boolean circuits, tensor ranks and communication complexity. To appear in SIAM J. Comput.
L. G. Valiant. Graph-theoretic arguments in low level complexity. In Proc. of the 6th MFCS, LNCS 53, pages 162–176. Springer-Verlag, 1977.
A. C.-C. Yao. On ACC and threshold circuits. In Proc. of the 31st FOCS, pages 619–627. IEEE, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damm, C., Jukna, S., Sgall, J. (1996). Some bounds on multiparty communication complexity of pointer jumping. In: Puech, C., Reischuk, R. (eds) STACS 96. STACS 1996. Lecture Notes in Computer Science, vol 1046. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_52
Download citation
DOI: https://doi.org/10.1007/3-540-60922-9_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60922-3
Online ISBN: 978-3-540-49723-3
eBook Packages: Springer Book Archive