Characterizing co-NL by a group action

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.

To appear in Mathematical Structures in Computer Science

References in corpus (2)

• Sublogarithmic uniform Boolean proof nets
• Interaction Graphs: Additives

Cited by in corpus (11)

• Logarithmic Space and Permutations
• Towards a Complexity-through-Realisability Theory
• Interaction Graphs: Exponentials
• Interaction Graphs: Graphings
• A Correspondence between Maximal Abelian Sub-Algebras and Linear Logic Fragments
• Memoization for Unary Logic Programming: Characterizing PTIME
• Probabilistic Complexity Classes through Semantics
• Interaction Graphs: Nondeterministic Automata
• Interaction Graphs: Additives
• Logic Programming and Logarithmic Space
• An in-between "implicit" and "explicit" complexity: Automata