Skip to main content
SpringerLink
Log in

If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 89 (STACS 1989)

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

Included in the following conference series:

Abstract

It is well known that for any „well behaved“ space function L(n) ≥ log n if DSPACE(L(n)) = NSPACE(L(n)) then also DSPACE(H(n)) = NSPACE(H(n)) for all „well behaved“ functions H(n) ≥ L(n). The aim of this paper is to show that also if DSPACE(log log n) = NSPACE(log log n) then L = NL (i.e. DSPACE(log n) = NSPACE(log n)).

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. R. Freivalds, On the worktime of deterministic and nondeterministic Turing machines (in Russian). Latvijskij Matematiceskij Eshegodnik 23 (1979) 158–165.

    Google Scholar 

  2. R. Kannan, Alternation and the power of nondeterminism. 15-th STOC (1983) 344–346.

    Google Scholar 

  3. P. M. Lewis II, R. E. Stearns and J. Hartmanis, Memory bounds for the recognition of context-free and context-sensitive languages. IEEE Conf. Rec. on Switching Circuit Theory and Logical Design, NY (1965) 191–202.

    Google Scholar 

  4. B. Monien, On the LBA problem. LNCS 117, Fundamentals of Computation Theory, Proc. of 1981 International FCT-Conference, Szeged, Hungary, 1981 Springer Verlag Berlin, Heidelberg, New York 1981, 265–280.

    Google Scholar 

  5. W. Narkiewicz, Number Theory (translated by S. Kanemitsu). World Scientific Publishing Co. 1983.

    Google Scholar 

  6. W.J. Savitch, Relationships between nondeterministic and deterministic tape complexities. J. of Computer and System Sc., 4 (1970) 177–192.

    Google Scholar 

  7. M. Sipser, Halting space-bounded computations. TCS 10 (1980) 335–338.

    Google Scholar 

  8. A. Szepietowski, Remarks on languages acceptable in log log n space. IPL 27 (1988) 4, 201–203.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Department, Technical University of Gdańsk, Majakowskiego 11/12, PL-80-952, Gdańsk, Poland

    Andrzej Szepietowski

Authors
  1. Andrzej Szepietowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Szepietowski, A. (1989). If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n . In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028989

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50840-3

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation