Published in

Cambridge University Press (CUP), Mathematical Structures in Computer Science, p. 1-33

DOI: 10.1017/s0960129514000267

Links

Tools

Export citation

Search in Google Scholar

Characterizingco-NLby a group action

Journal article published in 2014 by Clément Aubert ORCID, Thomas Seiller ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

In a recent paper, Girard proposes to use his recent construction of a geometry of interaction in the hyperfinite factor 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 as a technical tool the non-deterministic pointer machine, a concrete model to computes algorithms. ; Comment: To appear in Mathematical Structures in Computer Science