Planned intervention: On Wednesday June 26th 05:30 UTC Zenodo will be unavailable for 10-20 minutes to perform a storage cluster upgrade.
Published December 5, 2014 | Version v1
Journal article Open

Characterizingco-NLby a group action

Description

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

Files

article.pdf

Files (311.5 kB)

Name Size Download all
md5:f18df40d8e6ccea9d23cd61ce10415b8
311.5 kB Preview Download