The complexity of problems concerning graphs with regularities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 176 LNCS, Issue , 1984, Pages 544-552

  Wagner, K ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947719043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0030338     Document Type: Conference Paper

References (11)

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.
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.
3. Jones, N.D., Lien, Y.E., Laaser, W.T., New problems complete for nondeterministic log space, Mathematical Systems Theory 10(1976), 1–17.
4. Jones, N.D., Space-bounded reducibility among combinatorial problems, Journal of Computer and System Sciences 11(1975), 68–85.
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.
6. Stockmeyer, L.J., Meyer, A.R., Word problems requiring exponential time, Proc. of the 5th STOC(1973), 1–9.
7. Stockmeyer, L.J., The polynomial-time hierarchy, Theoretical Computer Science 3(1977), 1–22.
8. Sudborough, I.H., On tape-bounded complexity classes and multihead finite automata, Journal of Computer and System Sciences 10(1975), 62–76.
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.
10. Wagner, K., The counting polynomial-time hierarchy, preprint.
11. Wagner, K., The complexity of combinatorial problems with compactly described instances, preprint.