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="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Aubert, Clément</dc:creator>
  <dc:creator>Seiller, Thomas</dc:creator>
  <dc:date>2014-12-05</dc:date>
  <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:identifier>https://zenodo.org/record/3967741</dc:identifier>
  <dc:identifier>10.1017/s0960129514000267</dc:identifier>
  <dc:identifier>oai:zenodo.org:3967741</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:title>Characterizingco-NLby a group action</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>
13
3
views
downloads
Views 13
Downloads 3
Data volume 934.4 kB
Unique views 13
Unique downloads 3

Share

Cite as