Unification and Logarithmic Space

From MaRDI portal
Publication:5170809

DOI10.1007/978-3-319-08918-8_6zbMATH Open1416.68076arXiv1402.4327OpenAlexW3101368285MaRDI QIDQ5170809FDOQ5170809

Clément Aubert, Marc Bagnol

Publication date: 24 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof theory and more specifically linear logic and Geometry of Interaction. We show how unification can be used to build a model of computation by means of specific subalgebras associated to finite permutations groups. We then prove that whether an observation (the algebraic counterpart of a program) accepts a word can be decided within logarithmic space. We also show that the construction can naturally represent pointer machines, an intuitive way of understanding logarithmic space computing.


Full work available at URL: https://arxiv.org/abs/1402.4327




Recommendations





Cited In (2)





This page was built for publication: Unification and Logarithmic Space

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