Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
An Overview of the Theory of Computational Complexity
Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
Type two computational complexity
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY
RELATIVIZATION OF THE THEORY OF COMPUTATION COMPLEXITY
Formal languages and their relation to automata
Formal languages and their relation to automata
Algebraically generalized recursive function theory
IBM Journal of Research and Development
Indexing of subrecursive classes
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On characterizations of the basic feasible functionals, Part I
Journal of Functional Programming
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Time-Complexity Semantics for Feasible Affine Recursions
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
| Hi-index | 0.00 |
We define polynomial time computable operator. Our definition generalizes Cook's definition to arbitrary function inputs. Polynomial classes are defined in terms of these operators; the properties of these classes are investigated. Honest polynomial classes are generated by running time. They posses a modified Ritchie-Cobham property. A polynomial class is a complexity class iff it is honest. Starting from the observation that many results about subrecursive classes hold for all reducibility relations (e.g. primitive recursive in, elementary recursive in), which were studied so far, we define abstract subrecursive reducibility relation. Many results hold for all abstract subrecursive reducibilities.