Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
Polynomial and abstract subrecursive classes
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
Sparse sets in NP-P: Exptime versus nexptime
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Random access to advice strings and collapsing results
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
A theory of subrecursive indexings is developed, with emphasis on relationships between reducibilities, uniform simulation, and diagonalization.