Abstract Computational Complexity and Cycling Computations
暂无分享,去创建一个
[1] Ivan M. Havel,et al. Weak complexity measures , 1971, SIGA.
[2] Albert R. Meyer,et al. Classes of computable functions defined by bounds on computation: Preliminary Report , 1969, STOC.
[3] Allan Borodin,et al. Complexity Classes of Recursive Functions and the Existence of Complexity Gaps , 1969, Symposium on the Theory of Computing.
[4] R. Constable. Upward and Downward Diagonalization over Axiomatic Complexity Classes , 1969 .
[5] Edward L. Robertson,et al. Recursive properties of abstract complexity classes (Preliminary Version) , 1970, STOC.
[6] Giorgio Ausiello,et al. On bounds on the number of steps to compute functions , 1970, STOC.
[7] Sanat K. Basu. On classes of computable functions , 1969, STOC '69.
[8] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.