On time versus space III

Paul and Reischuk devised space efficient simulations of logarithmic cost random access machines and multidimensional Turing machines. We simplify their general space reduction technique and extend it to other computational models, including pointer machines, which model computations on graphs and data structures. Every pointer machine of time complexityT(n) can be simulated by a pointer machine of space complexityO(T(n)/logT(n)).

[1]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[2]  Michael Ian Shamos,et al.  Time and Space , 1977 .

[3]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[4]  Martin Tompa.  Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits , 1980, J. Comput. Syst. Sci..

[5]  A. D. Palù,et al.  Universita' Degli Studi Di Verona Facolta' Di Scienze Mm Ff E Nn Tesi Di Laurea New Optimal Algorithms on Pointer Machines , 2004 .

[6]  Patrick W. Dymond,et al.  Speedups of deterministic machines by synchronous parallel machines , 1983, J. Comput. Syst. Sci..

[7]  Wolfgang J. Paul,et al.  On time versus space II , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[9]  Jon Louis Bentley,et al.  A General Class of Resource Tradeoffs , 1982, J. Comput. Syst. Sci..

[10]  Allan Borodin,et al.  A time-space tradeoff for sorting on a general sequential model of computation , 1980, STOC '80.

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

[12]  Robert E. Tarjan,et al.  A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..

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

[14]  Michael C. Loui,et al.  Space-bounded simulation of multitape turing machines , 1981, Mathematical systems theory.

[15]  M. Fischer,et al.  AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION , 1974 .

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