Space-bounded simulation of multitape turing machines-Reference-Cited by-同舟云学术

Space-bounded simulation of multitape turing machines

Published:1981-12 Issue:1 Volume:14 Page:215-222
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Adleman Leonard M.,Loui Michael C.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01752397.pdf

Reference7 articles.

1. J. Hopcroft, W. Paul, and L. Valiant, On time versus space,J. ACM, 24, 332–337 (1977).

2. J. E. Hopcroft and J. D. Ullman, Relations between time and tape complexities,J. ACM, 15, 414–427 (1968).

3. J. E. Hopcroft and J. D. Ullman,Formal Languages and their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.

4. M. S. Paterson, Tape bounds for time-bounded Turing machines,J. Comp. Sys. Sci., 6, 116–124 (1972).

5. M. S. Paterson, M. J. Fischer, and A. R. Meyer, An improved overlap argument for on-line multiplication,Complexity of Computation, SIAM-AMS Proc. vol. 7, ed. R. Karp, Amer. Math. Soc., 1974, pp. 97–111.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The size and depth of layered Boolean circuits;Information Processing Letters;2011-02

2. The Size and Depth of Layered Boolean Circuits;LATIN 2010: Theoretical Informatics;2010

3. A Guide for New Referees in Theoretical Computer Science;Information and Computation;1994-07

4. Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones;SIAM Journal on Computing;1990-06

5. A guide for new referees in theoretical computer science;ACM SIGACT News;1989-11