Computational complexity of random access stored program machines
暂无分享,去创建一个
[1] M. Rabin. Real time computation , 1963 .
[2] Juris Hartmanis. Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.
[3] Allan Borodin,et al. Complexity Classes of Recursive Functions and the Existence of Complexity Gaps , 1969, Symposium on the Theory of Computing.
[4] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.
[5] Abraham Robinson,et al. Random-Access Stored-Program Machines, an Approach to Programming Languages , 1964, JACM.
[6] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[7] Albert R. Meyer,et al. Classes of computable functions defined by bounds on computation: Preliminary Report , 1969, STOC.
[8] Juris Hartmanis. Tape-Reversal Bounded Turing Machine Computations , 1968, J. Comput. Syst. Sci..
[9] Manuel Blum,et al. Tape Reversal Complexity Hierarchies , 1968, SWAT.
[10] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[11] F. C. Hennie,et al. One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..