Logarithmic space and permutations

Clément Aubert; Thomas Seiller

doi:10.1016/j.ic.2014.01.018

Logarithmic space and permutations

Clément Aubert, Thomas Seiller

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	2-21
Number of pages	20
Journal	Information and Computation
Volume	248
DOIs	https://doi.org/10.1016/j.ic.2014.01.018
State	Published - Jun 1 2016
Externally published	Yes

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

Access to Document

10.1016/j.ic.2014.01.018

Cite this

@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 = jun,

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

SN - 0890-5401

VL - 248

SP - 2

EP - 21

JO - Information and Computation

JF - Information and Computation

ER -

Logarithmic space and permutations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this