Skip to main content
SpringerLink
Log in

The complexity of problems concerning graphs with regularities

Extented abstract

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1984 (MFCS 1984)

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

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. Bentley, J.L., Ottmann, T., The complexity of manipulating hierarchically defined sets of rectangles, MFCS 1981, in Lecture Notes in Computer Science 118, 1–15.

    Google Scholar 

  2. Garey, M.R., Johnson, D.S., Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco 1979.

    Google Scholar 

  3. Jones, N.D., Lien, Y.E., Laaser, W.T., New problems complete for nondeterministic log space, Mathematical Systems Theory 10(1976), 1–17.

    Google Scholar 

  4. Jones, N.D., Space-bounded reducibility among combinatorial problems, Journal of Computer and System Sciences 11(1975), 68–85.

    Google Scholar 

  5. Meyer, A.R., Stockmeyer, L.J., The equivalence problem for regular expressions with squaring requires exponential space, Proc. of the 13th SWAT (1972), 125–129.

    Google Scholar 

  6. Stockmeyer, L.J., Meyer, A.R., Word problems requiring exponential time, Proc. of the 5th STOC(1973), 1–9.

    Google Scholar 

  7. Stockmeyer, L.J., The polynomial-time hierarchy, Theoretical Computer Science 3(1977), 1–22.

    Google Scholar 

  8. Sudborough, I.H., On tape-bounded complexity classes and multihead finite automata, Journal of Computer and System Sciences 10(1975), 62–76.

    Google Scholar 

  9. Wagner, K., Compact descriptions and the counting polynomial-time hierarchy (extended abstract), to appear in the Proc. of the 2nd Frege Conf., Schwerin 1984.

    Google Scholar 

  10. Wagner, K., The counting polynomial-time hierarchy, preprint.

    Google Scholar 

  11. Wagner, K., The complexity of combinatorial problems with compactly described instances, preprint.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik Friedrich-Schiller-Universität, Universitätshochhaus, DDR 6900, Jena

    K. Wagner

Authors
  1. K. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wagner, K. (1984). The complexity of problems concerning graphs with regularities. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030338

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation