Logspace without bounds

MaRDI QIDQ3081649zbMATH OpenFDO

Authors Isabel Oitavem

Publication date 9 March 2011

zbMATH Keywords

logarithmic spaceimplicit complexityrecursion-theoretic characterization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2006637
• Logical Approaches to Computational Barriers
• Neat function algebraic characterizations of LOGSPACE and LINSPACE
• Bridging across the (n) space frontier
• LOGSPACE and PTIME characterized by programming languages

Cited in

(4)

• Applicative theories for logarithmic complexity classes
• Computation by interaction for space-bounded functional programming
• Ramified Corecurrence and Logspace
• Regressive computations characterize logarithmic space

This page was built for publication: Logspace without bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3081649)