Logarithmic space and permutations

Clément Aubert, Thomas Seiller

Research output: Contribution to journalArticle

8 Scopus citations

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

Original languageEnglish (US)
Pages (from-to)2-21
Number of pages20
JournalInformation and Computation
Volume248
DOIs
StatePublished - Jun 1 2016
Externally publishedYes

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Logarithmic space and permutations'. Together they form a unique fingerprint.

  • Cite this