Journal article Open Access

Characterizingco-NLby a group action

Aubert, Clément; Seiller, Thomas


JSON-LD (schema.org) Export

{
  "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", 
  "license": "", 
  "creator": [
    {
      "@id": "https://orcid.org/0000-0001-6346-3043", 
      "@type": "Person", 
      "name": "Aubert, Cl\u00e9ment"
    }, 
    {
      "@type": "Person", 
      "name": "Seiller, Thomas"
    }
  ], 
  "headline": "Characterizingco-NLby a group action", 
  "image": "https://zenodo.org/static/img/logos/zenodo-gradient-round.svg", 
  "datePublished": "2014-12-05", 
  "url": "https://zenodo.org/record/3967741", 
  "@context": "https://schema.org/", 
  "identifier": "https://doi.org/10.1017/s0960129514000267", 
  "@id": "https://doi.org/10.1017/s0960129514000267", 
  "@type": "ScholarlyArticle", 
  "name": "Characterizingco-NLby a group action"
}
13
3
views
downloads
Views 13
Downloads 3
Data volume 934.4 kB
Unique views 13
Unique downloads 3

Share

Cite as