Journal article Open Access

Characterizingco-NLby a group action

Aubert, Clément; Seiller, Thomas

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 (311.5 kB)
Name Size
article.pdf
md5:f18df40d8e6ccea9d23cd61ce10415b8
311.5 kB Download
34
12
views
downloads
Views 34
Downloads 12
Data volume 3.7 MB
Unique views 33
Unique downloads 11

Share

Cite as