Publication:4339320
From MaRDI portal
zbMath0872.03028MaRDI QIDQ4339320
Publication date: 9 June 1997
Full work available at URL: https://eudml.org/doc/44242
composition; basis functions; elementary functions; PSPACE; recursion-theoretic characterization; polynomially space-computable functions; subrecursive function classes; variants of recursion
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
A Refinement of the μ-measure for Stack Programs, A recursion-theoretic characterisation of the positive polynomial-time functions, Implicit characterizations of FPTIME and NC revisited, On the computational complexity of imperative programming languages