Unification and Logarithmic Space

@article{Aubert2018UnificationAL,
  title={Unification and Logarithmic Space},
  author={C. Aubert and Marc Bagnol},
  journal={Log. Methods Comput. Sci.},
  year={2018},
  volume={14}
}
  • C. Aubert, Marc Bagnol
  • Published 2018
  • Computer Science
  • Log. Methods Comput. Sci.
  • 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 rooted in proof theory and more specifically linear logic and geometry of interaction. We show how to build a model of computation in the unification algebra and then, by means of a syntactic representation of finite permutations in the algebra, we prove that whether an observation… CONTINUE READING
    1 Citations
    Unary Resolution: Characterizing Ptime
    • 8
    • PDF

    References

    SHOWING 1-10 OF 46 REFERENCES
    Unification and Logarithmic Space
    • 7
    • PDF
    Logarithmic space and permutations
    • 19
    • PDF
    On the Resolution Semiring
    • 6
    • PDF
    A correspondence between maximal abelian sub-algebras and linear logic fragments
    • T. Seiller
    • Mathematics, Computer Science
    • Math. Struct. Comput. Sci.
    • 2018
    • 9
    • PDF
    Linear logic by levels and bounded time complexity
    • 30
    • PDF
    On the Sequential Nature of Unification
    • 233
    • PDF
    Unary Resolution: Characterizing Ptime
    • 8
    • PDF
    Elementary Complexity and Geometry of Interaction
    • 72
    • PDF