2000 character limit reached
Logarithmic Space and Permutations (1301.3189v4)
Published 15 Jan 2013 in cs.LO, cs.CC, and math.LO
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.