Journal of the ACM Bibliography

Additional Key Words and Phrases: computational complexity, complexity class, recursive function, recursive operator, effective operator, priority argument

Selected papers that cite this one

• Leonard Bass and Paul Young. Ordinal hierarchies and naming complexity classes. Journal of the ACM, 20(4):668-686, October 1973.

• Joel I. Seiferas and Albert R. Meyer. Characterizations of realizable space complexities. Annals of Pure and Applied Logic, 73(2):171-190, 1 June 1995.

Selected references

• Manuel Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322-336, April 1967.

• A. Borodin. Complexity classes of recursive functions and the existence of complexity gaps. In Conference Record of ACM Symposium on Theory of Computing, pages 67-78, Marina del Rey, California, 5-7 May 1969.

• E. M. McCreight and A. R. Meyer. Classes of computable functions defined by bounds on computation: Preliminary report. In Conference Record of ACM Symposium on Theory of Computing, pages 79-88, Marina del Rey, California, 5-7 May 1969.

• Paul R. Young. Speed-ups by changing the order in which sets are enumerated (preliminary version). In Conference Record of ACM Symposium on Theory of Computing, pages 89-92, Marina del Rey, California, 5-7 May 1969.

Shortcuts: