Characterizing PSPACE with pointers

DOI10.1002/malq.200610056zbMath1142.03021OpenAlexW2057260190MaRDI QIDQ3506329

Isabel Oitavem

Publication date: 12 June 2008

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200610056

zbMATH Keywords

computational complexityPSPACEimplicit characterization

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 (6)

Algorithmically broad languages for polynomial time and space ⋮ A recursion-theoretic approach to NP ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ The polynomial hierarchy of functions and its levels ⋮ Implicit recursion-theoretic characterizations of counting classes ⋮ Implicit computation complexity in higher-order programming languages

Cites Work

• Unnamed Item

This page was built for publication: Characterizing PSPACE with pointers