Feb 18, 2014 · We show how unification can be used to build a model of computation by means of specific subalgebras associated to finite permutations groups.
May 29, 2018 · We show how to build a model of computation in the unification algebra and then, by means of a syntactic representation of finite permutations ...
People also ask
What is meant by log space?
Can space complexity be logarithmic?
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 ...
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition.
Jul 31, 2018 · Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law ...
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 ...
This new bridge between unification and complexity classes is inspired from proof theory and more specifically linear logic and Geometry of Interaction. We show ...
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 ...
Abstract. We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition.
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification.