Logarithmic space and permutations

Clément Aubert, Thomas Seiller

Research output: Contribution to journalArticle

8 Citations (Scopus)

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

Fingerprint

Hilbert spaces
Mathematical operators
Computational complexity
Logarithmic
Permutation
Operator
Computational Complexity
Correspondence
Hilbert space
Language
Class

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

Cite this

Logarithmic space and permutations. / Aubert, Clément; Seiller, Thomas.

In: Information and Computation, Vol. 248, 01.06.2016, p. 2-21.

Research output: Contribution to journalArticle

Aubert, Clément ; Seiller, Thomas. / Logarithmic space and permutations. In: Information and Computation. 2016 ; Vol. 248. pp. 2-21.
@article{185e3950b93a4948b13702a111e8a5cc,
title = "Logarithmic space and permutations",
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.",
keywords = "Complexity, Finite automata, Geometry of interaction, Linear logic, Logarithmic space, Pointer machine",
author = "Cl{\'e}ment Aubert and Thomas Seiller",
year = "2016",
month = "6",
day = "1",
doi = "10.1016/j.ic.2014.01.018",
language = "English (US)",
volume = "248",
pages = "2--21",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Logarithmic space and permutations

AU - Aubert, Clément

AU - Seiller, Thomas

PY - 2016/6/1

Y1 - 2016/6/1

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

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

KW - Complexity

KW - Finite automata

KW - Geometry of interaction

KW - Linear logic

KW - Logarithmic space

KW - Pointer machine

UR - http://www.scopus.com/inward/record.url?scp=84955562343&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84955562343&partnerID=8YFLogxK

U2 - 10.1016/j.ic.2014.01.018

DO - 10.1016/j.ic.2014.01.018

M3 - Article

AN - SCOPUS:84955562343

VL - 248

SP - 2

EP - 21

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -