Logarithmic Space and Permutations
Logic in Computer Science
2019-06-04 v4 Computational Complexity
Logic
Abstract
In a recent work, Girard proposed a new and innovative approach to computational complexity based on the proofs-as-programs correspondence. In a previous paper, the authors showed how Girard proposal succeeds in obtaining a new characterization of co-NL languages as a set of operators acting on a Hilbert Space. In this paper, we extend this work by showing that it is also possible to define a set of operators characterizing the class L of logarithmic space languages.
Cite
@article{arxiv.1301.3189,
title = {Logarithmic Space and Permutations},
author = {Clément Aubert and Thomas Seiller},
journal= {arXiv preprint arXiv:1301.3189},
year = {2019}
}