scientific article; zbMATH DE number 1018349

From MaRDI portal

Revision as of 21:49, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4339320

Jump to:navigation, search

zbMath0872.03028MaRDI QIDQ4339320

Isabel Oitavem

Publication date: 9 June 1997

Full work available at URL: https://eudml.org/doc/44242

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

composition basis functions elementary functions PSPACE recursion-theoretic characterization polynomially space-computable functions subrecursive function classes variants of recursion

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (4)

A Refinement of the μ-measure for Stack Programs ⋮ A recursion-theoretic characterisation of the positive polynomial-time functions ⋮ On the computational complexity of imperative programming languages ⋮ Implicit characterizations of FPTIME and NC revisited

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4339320&oldid=18304570"