@article{Aubert2014,
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},
author = {Aubert, ClĂ©ment and Seiller, Thomas},
doi = {10.1017/s0960129514000267},
journal = {Mathematical Structures in Computer Science},
month = {dec},
pages = {1-33},
title = {Characterizingco-NLby a group action},
url = {https://zenodo.org/record/3967741/files/article.pdf},
year = {2014}
}