Abstract
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the relevant proof techniques. We show that, for a slightly modified Turing machine model, the low level deterministic and nondeterministic space bounded complexity classes are different. Furthermore, for this computation model, we show that Savitch and Immerman-Szelepcsényi theorems do not hold in the range lg lg n to lg n. We also discuss some other computation models to bring out and clarify the importance of space constructibility and establish some results about these models. We conclude by enumerating a few open problems which arise out of the discussion.
Supported by NSF Research Grant DCR 85-20597
Supported by NSF Research Grant DCR 85-20597
Preview
Unable to display preview. Download preview PDF.
References
A.R. Freedman and R.E. Ladner. Space bounds for processing counterless inputs. Journal of Computer and System Sciences, 11:118–128, 1975.
R. Freivalds. On the worktime of deterministic and non-deterministic turing machines. Latvijskij Matematiceskij Eshegodnik, 23:158–165, 1979.
J. Hartmanis, R. Chang, J. Kadin, and S. Mitchell. Some observations about space bounded computations. Bulletin of the EATCS, 35:82–92, June 1988.
J. Hartmanis and H.H. Hunt. On the LBA problem and its importance in the theory of computation. SIAM-AMS, 7:1–26, 1974.
J.E. Hopcroft and J.D. Ullman. Introduction to Automats Theory, Languages and Computation. Addison-Wesley Publishing Company, 1979.
Neil Immerman. Nondeterministic space is closed under complement. In Proceedings of Structure in Complexity Theory Third Annual Conference, pages 112–115. Computer Society of IEEE, 1988.
S.Y. Kuroda. Classes of languages and linearly-bounded automata. Information and Control, 7:207–223, 1964.
P.M. Lewis II, R.E. Stearns, and J. Hartmanis. Memory bounds for recognition of context-free and context-sensitive languages. In IEEE Conference Record on Switching Circuit Theory and Logic Design, pages 191–202, 1965.
W.J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4:177–192, 1970.
Seiferas. A note on notions of tape constructibility. Technical Report CSD-TR 187, Pennsylvania State University, 1976.
M. Sipser. Halting space-bounded computations. Theoretical Computer Science, 10:335–338, 1980.
R.E. Stearns, J. Hartmanis, and P.M. Lewis II. Heirarchies of memory limited computations. In 1965 IEEE Conference Record on Switching Circuit Theory and Logical Design, pages 179–190, 1965.
R. Szelepcsényi. The method of forcing for nondeterministic automata. The Bulletin of the European Association for Theoretical Computer Science, 33:96–100, October 1987.
A. Szepietowski. Some notes on strong and weak log log n space complexity. Technical report, Mathematical Department, Technical University of Gda ńsk, Majakowskiego 11/12, PL-80-952 Gdańsk, Poland, 1988.
A. Szepietowski. If deterministic and nondeterministic space complexity are equal for log log n then they are equal for log n. In Lecture Notes in Computer Science, volume 349, pages 251–255. Springer-Verlag, 1989. STACS '89.
C.B. Wilson. Relativized circuit complexity. Journal of Computer and System Sciences, 31:169–181, 1985.
C.B. Wilson. Parallel computation and the NC heirarchy relativized. In Lecture Notes in Computer Science, volume 223, pages 362–382. Springer-Verlag, 1986. Structure in Complexity Theory.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartmanis, J., Ranjan, D. (1989). Space bounded computations : Review and new separation results. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_56
Download citation
DOI: https://doi.org/10.1007/3-540-51486-4_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51486-2
Online ISBN: 978-3-540-48176-8
eBook Packages: Springer Book Archive