论文信息 - On Time versus Space II. (Turing Machines)

On Time versus Space II. (Turing Machines)

Every t(n)-time bounded RAM (assuming the logarithmic cost measure) can be simulated by a t(n)/log t(n)-space bounded Turing machine and every t(n)-time bounded Turing machine with d-dimensional tapes by a t(n)5d·log∗t(n)/log t(n)-space bounded machine, where n is the length of the input. A class E of storage structures which generalizes multidimensional tapes is defined. Every t(n)-time bounded Turing machine whose storage structures are in E can be simulated by a t(n) loglog t(n)/log t(n)-space bounded Turing machine.

Wolfgang J. Paul | Rüdiger Reischuk | R. Reischuk | W. Paul

[1] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[2] Rüdiger Reischuk. A "Fast Implementation" of a Multidimensional Storage into a Tree Storage , 1980, ICALP.

[3] Michael C. Loui,et al. A Space Bound for One-Tape Multidimensional Turing Machines , 1981, Theor. Comput. Sci..

[4] Zvi Galil,et al. Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms , 1976, Inf. Process. Lett..

[5] Mike Paterson. Tape Bounds for Time-Bounded Turing Machines , 1972, J. Comput. Syst. Sci..

[6] Jeffrey D. Ullman,et al. Relations Between Time and Tape Complexities , 1968, JACM.

[7] F. C. Hennie,et al. On-Line Turing Machine Computations , 1966, IEEE Trans. Electron. Comput..

[8] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.

[9] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .

[10] Michael J. Fischer,et al. Relations Among Complexity Measures , 1979, JACM.

[11] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .