<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-02458358v2</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-13T02:34:11+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Implicit complexity through linear realisability: polynomial time and probabilistic classes</title>
            <author role="aut">
              <persName>
                <forename type="first">Thomas</forename>
                <surname>Seiller</surname>
              </persName>
              <email type="md5">178af3fac5c9f02ec042a0c5febae52b</email>
              <email type="domain">lipn.fr</email>
              <idno type="idhal" notation="string">seiller</idno>
              <idno type="idhal" notation="numeric">2282</idno>
              <idno type="halauthorid" notation="string">20300-2282</idno>
              <idno type="ARXIV">https://arxiv.org/a/seiller_t_1</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6313-0898</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=n4iFtEgAAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/169626423</idno>
              <affiliation ref="#struct-1000994"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Thomas</forename>
                <surname>Seiller</surname>
              </persName>
              <email type="md5">178af3fac5c9f02ec042a0c5febae52b</email>
              <email type="domain">lipn.fr</email>
            </editor>
            <funder ref="#projanr-66001"/>
            <funder ref="#projeurop-147002"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2020-01-28 16:16:12</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2023-02-10 15:26:02</date>
              <date type="whenWritten">2023-01</date>
              <date type="whenModified">2025-12-03 14:48:03</date>
              <date type="whenReleased">2023-02-10 16:24:11</date>
              <date type="whenProduced">2023-01</date>
              <date type="whenEndEmbargoed">2023-01-24</date>
              <ref type="file" target="https://hal.science/hal-02458358v2/document">
                <date notBefore="2023-01-24"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-02458358v2/file/HAL2023.pdf" id="file-3954065-3474594">
                <date notBefore="2023-01-24"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/2002.00009"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="179042">
                <persName>
                  <forename>Thomas</forename>
                  <surname>Seiller</surname>
                </persName>
                <email type="md5">178af3fac5c9f02ec042a0c5febae52b</email>
                <email type="domain">lipn.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02458358</idno>
            <idno type="halUri">https://hal.science/hal-02458358</idno>
            <idno type="halBibtex">seiller:hal-02458358</idno>
            <idno type="halRefHtml">2023</idno>
            <idno type="halRef">2023</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3954065-3474594"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-PARIS13">Université Paris-Nord - Paris XIII </idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="LIPN" corresp="UNIV-PARIS13">Laboratoire d'Informatique de Paris-Nord</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="SORBONNE-PARIS-NORD">Université Sorbonne Paris Nord</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="CONFRENCE-NATIONALE-SUR-LES-APPLICATIONS-PRATIQUES-DE-LINTELLIGENCE-ARTIFICIELLE" corresp="CNRS">Conférence Nationale sur les Applications Pratiques de l’Intelligence Artificielle </idno>
            <idno type="stamp" n="ACT-R" corresp="UNIV-PARIS13">Act'R </idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Implicit complexity through linear realisability: polynomial time and probabilistic classes</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Thomas</forename>
                    <surname>Seiller</surname>
                  </persName>
                  <email type="md5">178af3fac5c9f02ec042a0c5febae52b</email>
                  <email type="domain">lipn.fr</email>
                  <idno type="idhal" notation="string">seiller</idno>
                  <idno type="idhal" notation="numeric">2282</idno>
                  <idno type="halauthorid" notation="string">20300-2282</idno>
                  <idno type="ARXIV">https://arxiv.org/a/seiller_t_1</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6313-0898</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=n4iFtEgAAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/169626423</idno>
                  <affiliation ref="#struct-1000994"/>
                </author>
              </analytic>
              <monogr>
                <imprint/>
              </monogr>
              <idno type="arxiv">2002.00009</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="acm" n="F.1.1.0">F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded)</classCode>
              <classCode scheme="acm" n="F.1.2.4">F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation</classCode>
              <classCode scheme="acm" n="F.1.3.0">F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.0: Complexity hierarchies</classCode>
              <classCode scheme="acm" n="F.1.3.1">F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.1: Machine-independent complexity</classCode>
              <classCode scheme="acm" n="F.3.2.1">F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics</classCode>
              <classCode scheme="acm" n="F.3.2.2">F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics</classCode>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.1.1"/>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.2.0"/>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.2.9"/>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.3"/>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.3.10"/>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.7.1.1"/>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.7.1.2"/>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halDomain" n="math.math-ds">Mathematics [math]/Dynamical Systems [math.DS]</classCode>
              <classCode scheme="halDomain" n="math.math-lo">Mathematics [math]/Logic [math.LO]</classCode>
              <classCode scheme="halTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halOldTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halTreeTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Based on work on realisability models for linear logic, the author recently proposed a new approach of implicit computational complexity. He showed how to characterise in this way a hierarchy of sub-linear space non-deterministic complexity classes by means of group actions. These classes, defined by means of two-way non-deterministic automata, range from regular languages to NLogspace (non-deterministic logarithmic space).In the present paper, we extend those results in two directions. First, we show how the same techniques can be used to characterise the sub-linear space complexity classes defined by both deterministic and probabilistic two-way multi-head automata. We thus obtain characterisations of deterministic complexity classes between regular languages and Logspace, as well as a hierarchy of probabilistic classes between stochastic languages and PLogspace (unbounded error probabilistic logarithmic space). Second, we exhibit a monoid action capturing polynomial time computation based on pushdown machines, characterising both Ptime and PPtime (unbounded error probabilistic polynomial time).</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1000994" status="VALID">
          <idno type="IdRef">191907855</idno>
          <idno type="RNSR">200112433P</idno>
          <idno type="ROR">05g1zjw44</idno>
          <orgName>Laboratoire d'Informatique de Paris-Nord</orgName>
          <orgName type="acronym">LIPN</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Institut Galilée, Université Paris 13, 99 avenue Jean-Baptiste Clément, F-93430, Villetaneuse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www-lipn.univ-paris13.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR7030" active="#struct-441569" type="direct"/>
            <relation active="#struct-581146" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-581146" status="VALID">
          <idno type="IdRef">02640463X</idno>
          <idno type="ISNI">0000000121496883</idno>
          <idno type="ROR">https://ror.org/0199hds37</idno>
          <orgName>Université Sorbonne Paris Nord</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>99, avenue Jean-Baptiste Clément, 93430 Villetaneuse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-paris13.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-66001" status="VALID">
          <idno type="anr">ANR-22-CE48-0003</idno>
          <orgName>DySCo</orgName>
          <desc>Systèmes Dynamiques et Calcul: une approche logique</desc>
          <date type="start">2022</date>
        </org>
        <org type="europeanProject" xml:id="projeurop-147002" status="VALID">
          <idno type="number">659920</idno>
          <idno type="program">H2020-MSCA-IF-2014</idno>
          <idno type="call">H2020-MSCA-IF-2014</idno>
          <orgName>ReACT</orgName>
          <desc>A Realizability Approach to Complexity Theory</desc>
          <date type="start">2015-11-01</date>
          <date type="end">2018-03-27</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>