Characterizing co-NL by a group action
Logic in Computer Science
2015-01-23 v4 Computational Complexity
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.
Keywords
Cite
@article{arxiv.1209.3422,
title = {Characterizing co-NL by a group action},
author = {Clément Aubert and Thomas Seiller},
journal= {arXiv preprint arXiv:1209.3422},
year = {2015}
}
Comments
To appear in Mathematical Structures in Computer Science