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 permutation 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 encode pointer machines, an intuitive way of understanding logarithmic space computing. © 2014 Springer International Publishing Switzerland.
CITATION STYLE
Aubert, C., & Bagnol, M. (2014). Unification and logarithmic space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8560 LNCS, pp. 77–92). Springer Verlag. https://doi.org/10.1007/978-3-319-08918-8_6
Mendeley helps you to discover research relevant for your work.