Abstract
We present a notion of logspace reducibility among structures that is based on abstract state machines (ASM). Our reductions are logspace computable (due to the syntactic restrictions we impose on ASM-programs) and are equally expressive as the logic (FO+DTC) enriched with the ability to handle sets. On ordered structures they precisely capture Logspace. Our work continues that of Blass, Gurevich and Shelah on the choiceless fragment of Ptime. Indeed, our reductions can be seen as the choiceless fragment of Logspace.
Cite
CITATION STYLE
Grädel, E., & Spielmann, M. (1999). Logspace reducibility via abstract state machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1709, pp. 1738–1757). Springer Verlag. https://doi.org/10.1007/3-540-48118-4_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
