Characterizing co-NL by a group action

Clement Aubert, Thomas Seiller

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In a recent paper, Girard (2012) proposed to use his recent construction of a geometry of interaction in the hyperfinite factor (Girard 2011) in an innovative way to characterize complexity classes. We begin by giving a detailed explanation of both the choices and the motivations of Girard's definitions. We then provide a complete proof that the complexity class co-NL can be characterized using this new approach. We introduce the non-deterministic pointer machine as a technical tool, a concrete model to compute algorithms.

Original languageEnglish (US)
Pages (from-to)606-638
Number of pages33
JournalMathematical Structures in Computer Science
Volume26
Issue number4
DOIs
StatePublished - May 1 2016

Fingerprint

Complexity Classes
Group Action
Geometry
Interaction
Model

ASJC Scopus subject areas

  • Mathematics (miscellaneous)
  • Computer Science Applications

Cite this

Characterizing co-NL by a group action. / Aubert, Clement; Seiller, Thomas.

In: Mathematical Structures in Computer Science, Vol. 26, No. 4, 01.05.2016, p. 606-638.

Research output: Contribution to journalArticle

Aubert, Clement ; Seiller, Thomas. / Characterizing co-NL by a group action. In: Mathematical Structures in Computer Science. 2016 ; Vol. 26, No. 4. pp. 606-638.
@article{bea25aca3177435ca21e86e8958e3fbd,
title = "Characterizing co-NL by a group action",
abstract = "In a recent paper, Girard (2012) proposed to use his recent construction of a geometry of interaction in the hyperfinite factor (Girard 2011) in an innovative way to characterize complexity classes. We begin by giving a detailed explanation of both the choices and the motivations of Girard's definitions. We then provide a complete proof that the complexity class co-NL can be characterized using this new approach. We introduce the non-deterministic pointer machine as a technical tool, a concrete model to compute algorithms.",
author = "Clement Aubert and Thomas Seiller",
year = "2016",
month = "5",
day = "1",
doi = "10.1017/S0960129514000267",
language = "English (US)",
volume = "26",
pages = "606--638",
journal = "Mathematical Structures in Computer Science",
issn = "0960-1295",
publisher = "Cambridge University Press",
number = "4",

}

TY - JOUR

T1 - Characterizing co-NL by a group action

AU - Aubert, Clement

AU - Seiller, Thomas

PY - 2016/5/1

Y1 - 2016/5/1

N2 - In a recent paper, Girard (2012) proposed to use his recent construction of a geometry of interaction in the hyperfinite factor (Girard 2011) in an innovative way to characterize complexity classes. We begin by giving a detailed explanation of both the choices and the motivations of Girard's definitions. We then provide a complete proof that the complexity class co-NL can be characterized using this new approach. We introduce the non-deterministic pointer machine as a technical tool, a concrete model to compute algorithms.

AB - In a recent paper, Girard (2012) proposed to use his recent construction of a geometry of interaction in the hyperfinite factor (Girard 2011) in an innovative way to characterize complexity classes. We begin by giving a detailed explanation of both the choices and the motivations of Girard's definitions. We then provide a complete proof that the complexity class co-NL can be characterized using this new approach. We introduce the non-deterministic pointer machine as a technical tool, a concrete model to compute algorithms.

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

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

U2 - 10.1017/S0960129514000267

DO - 10.1017/S0960129514000267

M3 - Article

VL - 26

SP - 606

EP - 638

JO - Mathematical Structures in Computer Science

JF - Mathematical Structures in Computer Science

SN - 0960-1295

IS - 4

ER -