Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
LATIN '95: Theoretical Informatics (LATIN 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 911))

Included in the following conference series:

Abstract

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

  2. L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory, in: Proc. 27th IEEE FOCS, pp. 337–347, 1986.

    Google Scholar 

  3. B. Halstenberg, R. Reischuk, Relations between Communication Complexity Classes, in: Proc. 3rd IEEE Structure in Complexity Theory Conference, pp. 19–28, 1988.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  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: Proc. 32nd IEEE FOCS 1991, pp. 777–782.

    Google Scholar 

  8. Ch. Meinel, p-Projection reducibility and the complexity classes L(nonuniform) and NL(nonuniform), in: Proc. 12th MFCS, 1986, LNCS 233, 527–535.

    Google Scholar 

  9. Ch. Meinel, Modified branching programs and their computational power, LNCS 370, Springer-Verlag, 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, 273–290.

    Google Scholar 

  11. W. Savitch, Relationship between nondeterministic and deterministic tape complexities, J. Comput. System Sci. 4(1970), pp. 244–253.

    Google Scholar 

  12. Skyum, L. V. Valiant, A complexity theory based on Boolean algebra, Proc. 22nd IEEE FOCS, pp. 244–253.

    Google Scholar 

  13. A. Yao, The entropic limitations of VLSI computations, Proc. 13th ACM STOC 1981, pp. 308–311.

    Google Scholar 

  14. A. Yao, On ACC and Threshold Circuits, Proc. 31th IEEE FOCS 1990, pp. 619–627.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Christoph Meinel

  2. Inst. für Num. und Angew. Mathematik, Georg-August-Univ. Göttingen, Lotzestr. 16–18, D-37083, Göttingen

    Stephan Waack

Authors
  1. Christoph Meinel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stephan Waack
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ricardo Baeza-Yates Eric Goles Patricio V. Poblete

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meinel, C., Waack, S. (1995). Lower bounds for the modular communication complexity of various graph accessibility problems. In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds) LATIN '95: Theoretical Informatics. LATIN 1995. Lecture Notes in Computer Science, vol 911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59175-3_107

Download citation

  • DOI: https://doi.org/10.1007/3-540-59175-3_107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59175-7

  • Online ISBN: 978-3-540-49220-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation