scientific article; zbMATH DE number 1487500

MaRDI QIDQ4493909zbMATH OpenFDO

Authors Erich Grädel, Marc Spielmann

Publication date 11 January 2001

zbMATH Keywords

abstract state machineschoiceless fragment of LOGSPACElogspace computabilitylogspace reducibility among structures

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Recommendations

• Logspace Reducibility: Models and Equivalences
• scientific article; zbMATH DE number 3904572
• scientific article; zbMATH DE number 1841822
• The computable kernel of abstract state machines
• scientific article; zbMATH DE number 1951200

Cited in

(2)

• Logspace Reducibility: Models and Equivalences
• Choiceless Logarithmic Space

This page was built for publication:

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