Recursion Theoretic Operators for Function Complexity Classes

Authors:
Kenya Ueno
Affiliations:
-
Venue:
IEICE - Transactions on Information and Systems
Year:
2008

Citing 5
Cited 0

Polynomial space counting problems

SIAM Journal on Computing
PP is as hard as the polynomial-time hierarchy

SIAM Journal on Computing
A new recursion-theoretic characterization of the polytime functions

Computational Complexity
On Time Versus Space

Journal of the ACM (JACM)
Much Ado about Functions

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes based on recursive function theory and construct an operator which generates FP SPACE from FP. Then, we introduce new function classes composed of functions whose output lengths are bounded by the input length plus some constant. We characterize FP and FP SPACE by using these classes and operators. Finally, we define a new notion of completeness for FP SPACE and show a FP SPACE-complete function.