Logarithmic space and permutations

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's 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.

Authors

• Clément Aubert
• Thomas Seiller

Keywords

• Linear logic
• Complexity
• Geometry of interaction
• Pointer machine
• Finite automata
• Logarithmic space