Computational Complexity and the Existence of Complexity Gaps
暂无分享,去创建一个
[1] Hartley Rogers,et al. Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.
[2] M. Rabin. Degree of difficulty of computing a function and a partial ordering of recursive sets , 1960 .
[3] Hisao Yamada,et al. Real-Time Computation and Recursive Functions Not Real-Time Computable , 1962, IRE Trans. Electron. Comput..
[4] K. Hoechsmann. Simple algebras and derivations , 1963 .
[5] Robert W. Ritchie,et al. CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS , 1963 .
[6] A. Grzegorczyk. Some classes of recursive functions , 1964 .
[7] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[8] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.
[9] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.
[10] Manuel Blum. On the Size of Machines , 1967, Inf. Control..
[11] Patrick C. Fischer,et al. On Computational Speed-Up , 1968, SWAT.
[12] Manuel Blum,et al. Tape Reversal Complexity Hierarchies , 1968, SWAT.
[13] Juris Hartmanis. Computational Complexity of One-Tape Turing Machine Computations , 1968, JACM.
[14] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.
[15] R. Constable. Upward and Downward Diagonalization over Axiomatic Complexity Classes , 1969 .
[16] Allan Borodin,et al. Dense and Non-Dense Families of Complexity Classes , 1969, SWAT.
[17] Paul R. Young,et al. Toward a Theory of Enumerations , 1968, JACM.
[18] Albert R. Meyer,et al. Classes of computable functions defined by bounds on computation: Preliminary Report , 1969, STOC.
[19] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[20] Edward L. Robertson,et al. Recursive properties of abstract complexity classes (Preliminary Version) , 1970, STOC.
[21] Forbes D. Lewis,et al. Unsolvability considerations in computational complexity , 1970, STOC.
[22] Edward L. Robertson,et al. Recursive Properties of Abstract Complexity Classes , 1972, J. ACM.
[23] Allan Borodin,et al. Corrigendum: `` Computational Complexity and the Existence of Complexity Gaps'' , 1972, JACM.
[24] Robert L. Constable,et al. The Operator Gap , 1969, JACM.