Abstract
Nondetermistic logspace-bounded reductions are introduced. A set in DSPACE(log n), NP-complete with respect to these reductions, is exhibited, which makes the transitive closure of the NLOG(·)-operation quite unlikely, unless NSPACE(log n) = NP is assumed. In contrast to this the NLOG-closure of NLOG(NLOG(·))-classes is shown.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel, Transductions And Context-Free Languages, Teubner, Stuttgart, 1979
P. Flajolet, J.M. Steyart, Complexity Of Classes Of Languages And Operators, IRIA Rapport De Recherche No 92, 1974
M. Garey, D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Fransisco, 1979
S. Ginsburg, G. Rozenberg, TOL schemes and control sets, Inform. and Control 27 (1974), 109–125
J. Hartmanis, Feasible Computations and Provable Complexity Properties, SIAM Monographie, Philadelphia, 1978
J. Hartmanis, N. Immerman, S. Mahaney, One-way Log-Tape Reductions, Proc. of the 19th Symposium on Foundations of Computer Science (1978), 65–71
J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publ., Reading, 1979
N.D. Jones, S. Skyum, Recognition of deterministic ETOL Languages in logarithmic space, Inform. and Control 35 (1977), 177–181
R.E. Ladner, N. Lynch, Relativization of questions about Log space computability, Math. Sys. Theory 10 (1976), 19–32
R. Ladner, N. Lynch, A. Selman, A Comparison of Polynomial Time Reducibilities, Theor. Comput. Sci. 1 (1975), 103–123
B. Monien, I.H. Sudborough, The interface between language theory and complexity theory, in ‘Formal Language Theory’ (R.V. Book ed.), Academic Press, New York, 1980, 287–324
G. Rozenberg, A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980
L.J. Stockmeyer, A.R. Meyer, Word problems requiring exponential space, Proc. Fifth. Annual ACM Symposium on the Theory of Computing, 1–9, 1973
I. Sudborough, On tape bounded complexity classes and multihead finite automata, J. Comput. Syst. Sci 10 (1975), 62–76
I.H. Sudborough, The complexity of the membership problem for some extensions of context-free languages, Intern. J. Computer Math. 6 (1977), 191–215
I.H. Sudborouth, On the tape complexity of deterministic context-free languages, J. Assoc. Comput. Mach. 25 (1978) 405–414
J. van Leeuwen, The membership question for ETOL languages is polynomially complete, Inform. Process. Lett. 3 (1975) 138–143
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Klaus, Lange, J. (1984). Nondeterministic logspace reductions. 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/BFb0030320
Download citation
DOI: https://doi.org/10.1007/BFb0030320
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