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)
Word problems requiring exponential time(Preliminary Report)
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
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE
| Hi-index | 0.00 |
This paper contains several results yielding pairs of problems which don't help each other's solution, and therefore which may be said to be complex for “different reasons.” Statements are formalized and results proved within Blum complexity theory, generalized to relative algorithms. The approach is fairly intuitive; all details appear in [1] and [2].