Characterizing co-NL by a group action

Clément Aubert, Thomas Seiller

Research output: Contribution to journalArticle

8 Scopus citations

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

ASJC Scopus subject areas

  • Mathematics (miscellaneous)
  • Computer Science Applications

Cite this