Skip to main content
SpringerLink
Log in

Lower bounds for the majority communication complexity of various graph accessibility problems

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We investigate the probabilistic communication complexity (more exactly, the majority communication complexity), of the graph accessibility problem (GAP) and its counting versions MOD k -GAP,k ≥ 2. Due to arguments concerning matrix variation ranks and certain projection reductions, we prove that, for any partition of the input variables, GAP and MOD m -GAP have majority communication complexity Ω,(n), wheren denotes the number of nodes of the graph under consideration.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho, J. D. Ullman, M. Yannakakis. On notions of information transfer in VLSI circuits. In:Proceedings of the 15th ACM STOC, 1983, pp. 133–183.

  2. L. Babai, P. Frankl, J. Simon. Complexity classes in communication complexity theory. In:Proceedings of the 27thIEEE FOCS, 1986, pp. 337–347.

  3. B. Halstenberg, R. Reischuk. Relations between communication complexity classes. In:Proceedings of the 3rd IEEE Structure in Complexity Theory Conference, 1988, pp. 19–28.

  4. C. Damm, M. Krause, Ch. Meinel, St. Waack. Separating counting communication complexity classes. In:Proceedings of the 9th STACS, 1992, pp. 281–293. Lecture Notes in Computer Science, vol. 577. Springer-Verlag, Berlin.

    Google Scholar 

  5. A. Hajnal, W. Maass, G. Turan. On the communication complexity of graph problems. In:Proceedings of the 20th ACM STOC, 1988, pp. 186–191.

  6. N. Immerman. Languages that capture complexity classes.SIAM Journal of Computing,16 (4) (1978), pp. 760–778.

    Article  MathSciNet  Google Scholar 

  7. M. Krause, St. Waack. Variation ranks of communication matrices and lower bounds for depth, two circuits having symmetric gates with unbounded fan-in. In:Proceedings of the 32nd IEEE FOCS, 1991, pp. 777–782.

  8. Ch. Meinel.p-Projection reducibility and the complexity classes L (nonuniform) and NL(nonuniform). In:Proceedings of the 12thMFCS, 1986, pp. 527–535. Lecture Notes in Computer Science, vol. 233. Springer-Verlag, Berlin.

    Google Scholar 

  9. Ch. Meinel.Modified Branching Programs and Their Computational Power. Lecture Notes in Computer Science, vol. 370. Springer-Verlag, Berlin, 1989.

    Google Scholar 

  10. Ch. Meinel, St. Waack. Upper and lower bounds for certain graph-accessibility problems on bounded alternating Ω)-branching programs. In:Complexity Theory-Current Research (Eds., K. Ambos-Spies, S. Homer, U. Schöning). Cambridge University Press, 1993, pp. 273–290.

  11. Ch. Meinel, St. Waack. Lower bounds on the modular communication complexity of various graphaccessibility problems. In:Proceedings of the LATIN '95, pp. 427–435. Lecture Notes in Computer Science, vol. 911. Springer-Verlag, Berlin.

  12. K. Mehlhorn, E. M. Schmidt. Las Vegas is better than determinism in VLSI and distributed computing. In:Proceedings of the 14thACM STOC, 1982, pp. 330–337.

  13. R. Paturi, J. Simon. Probabilistic communication complexity.Journal of Computer and System Science,33 (1986), pp. 106–124.

    Article  MATH  MathSciNet  Google Scholar 

  14. R. Raz, B. Spieker. On the “log rank”-conjecture in communication complexity. In:Proceedings of the 34thIEEE FOCS, 1993, pp. 168–176.

  15. W. Savitch. Relationship between nondeterministic and deterministic tape complexities.Journal of Computer and System Science,4 (1970), pp. 244–253.

    MathSciNet  Google Scholar 

  16. Skyum, L. V. Valiant. A complexity theory based on Boolean algebra. In:Proceedings of the 22ndIEEE FOCS, pp. 244–253.

  17. A. Yao. The entropic limitations of VLSI computations. In:Proceedings of the 13thACM STOC, 1981, pp. 308–311.

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik, Fachbereich IV, Universität Trier, D-54286, Trier, Germany

    C. Meinel

  2. Institut für Numerisch und Angewandte Mathematik, Universität Göttingen, Lotzestrasse 16–18, D-37083, Gottingen, Germany

    S. Waack

Authors
  1. C. Meinel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Waack
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meinel, C., Waack, S. Lower bounds for the majority communication complexity of various graph accessibility problems. Math. Systems Theory 29, 649–659 (1996). https://doi.org/10.1007/BF01301969

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01301969

Keywords

Search

Navigation