Ordinal Hierarchies and Naming Complexity Classes

Authors:
Leonard Bass;Paul Young
Affiliations:
Computer Science and Experimental Statistics Department, University of Rhode Island, Kingston, Rhode Island;Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA and Purdue University, Lafayette, Indiana
Venue:
Journal of the ACM (JACM)
Year:
1973

Citing 12
Cited 0

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
A Machine-Independent Theory of the Complexity of Recursive Functions

Journal of the ACM (JACM)
Toward a Theory of Enumerations

Journal of the ACM (JACM)
An Overview of the Theory of Computational Complexity

Journal of the ACM (JACM)
Computational Complexity and the Existence of Complexity Gaps

Journal of the ACM (JACM)
The Operator Gap

Journal of the ACM (JACM)
Recursive Properties of Abstract Complexity Classes

Journal of the ACM (JACM)
On bounds on the number of steps to compute functions

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Classes of computable functions defined by bounds on computation: Preliminary Report

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The complexity of loop programs

ACM '67 Proceedings of the 1967 22nd national conference
Classes of computable functions defined by bounds on computation

Classes of computable functions defined by bounds on computation
Hierarchies based on computational complexity and irregularities of classdetermining measured sets

Hierarchies based on computational complexity and irregularities of classdetermining measured sets

Quantified Score

Hi-index	0.00

Visualization

Abstract