Hierarchies based on computational complexity and irregularities of classdetermining measured sets
- Author:
- Leonard Joel Bass
Abstract
No abstract available.
Cited By
Machtey M Classification of computable functions by primitive recursive classes Proceedings of the third annual ACM symposium on Theory of computing, (251-257)- Robertson E Complexity classes of partial recursive functions (Preliminary Version) Proceedings of the third annual ACM symposium on Theory of computing, (258-266)
Recommendations
Computational complexity simplified
MATH'08: Proceedings of the American Conference on Applied MathematicsThere exists a variety of techniques for the computational complexity analysis of algorithms and functions. This analysis is imperative to the algorithmic and the functional performance. Besides the big-oh complexity, there are other complexity ...
An overview of computational complexity
An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and ...