Journal article Open Access

Characterizingco-NLby a group action

Aubert, Clément; Seiller, Thomas

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Aubert, Clément</dc:creator>
  <dc:creator>Seiller, Thomas</dc:creator>
  <dc: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</dc:description>
  <dc:title>Characterizingco-NLby a group action</dc:title>
Views 35
Downloads 12
Data volume 3.7 MB
Unique views 34
Unique downloads 11


Cite as