Abstract
A symmetric Turing machine is one whose "yields" relation between configurations is symmetric. The space complexity classes for such machines are found to be intermediate between the corresponding deterministic and nondeterministic space complexity classes. Certain natural problems are shown to be complete for symmetric space complexity classes, and the relationship of symmetry to determinism and nondeterminism is investigated.
Research supported by NSF Grant MCS76-09375-A01.
Research supproted by NSF Grant MCS-77-01193.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz, C. Rackoff: Random walks, universal sequences, and the complexity of maze problems, Proceedings of 20th Annual Symposium on Foundations of Computer Science, 1979, pp. 218–223.
S.A. Cook: Characterizations of pushdown machines in terms of time-bounded computers, Journal of the Association for Computing Machinery 18 (1971), pp. 4–18.
A. Cypher: An approach to the k-paths problem, Proceedings of 12th Annual Symposium on Theory of Computing, 1980.
S. Fortune, J.E. Hopcroft, J. Wyllis: The directed subgraph homeomorphism problem, Theoretical Computer Science 10 (1980), pp. 111–121.
J. Gill: Computational complexity of probabilistic Turing machines, SIAM Journal on Computing 6 (1977), pp. 675–695.
J.D. Hopcroft, J.E. Ullman: Nonerasing stack automata, Journal of the Association for Computing Machinery 18 (1971), pp. 4–18.
J.D. Hopcroft, J.E. Ullman: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
H. Jia-wei: On some deterministic space complexity problems, Proceedings of 12th Annual Symposium on Theory of Computing, 1980.
N.D. Jones: Space-bounded reducibility among combinatorial problems, Journal of Computer and Systems Sciences 11 (1972), pp. 68–85.
N.D. Jones, Y.E. Lien, W.T. Laaser: New problems complete for log space, Mathematical Systems Theory 10 (1976), pp. 1–17.
A. LaPaugh: Private communication, November 1979.
A. LaPaugh, R.L. Rivest: The subgraph homeomorphism problem, Proceedings of 10th Annual Symposium on Theory of Computing, 1978, pp. 40–50.
H.R. Lewis, C.H. Papadimitriou: Elements of the Theory of Computation, Prentice-Hall, 1981 (to appear).
E.L. Post: Recursive unsolvability of a problem of Thue, Journal of Symbolic Logic 13 (1947), pp. 1–11.
S. Ruby and P.C. Fischer: Translational methods and computational complexity, IEEE Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 173–178.
W.J. Savitch: Relations between nondeterministic and deterministic tape complexities, Journal of Computer and Systems Sciences 4 (1970), pp. 177–192.
Y. Shiloach: The two paths problem is polynomial, Journal of the Association for Computing Machinery, to appear.
W.J. Sakoda, M. Sipser: Nondeterminism and the size of two-way finite automata, Proceedings of 10th Annual Symposium on Theory of Computing, 1978, pp. 275–286.
M. Sipser: Lower bounds on the size of sweeping automata, Proceedings of 11th Annual Symposium on Theory of Computing, 1979, pp. 360–364.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lewis, H.R., Papadimitriou, C.H. (1980). Symmertric space-bounded computation (extended abstract). In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_85
Download citation
DOI: https://doi.org/10.1007/3-540-10003-2_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10003-4
Online ISBN: 978-3-540-39346-7
eBook Packages: Springer Book Archive