<?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-01921942v7</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-14T00:01:37+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Unifying lower bounds for algebraic machines, semantically</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-441569"/>
              <affiliation ref="#struct-1000994"/>
              <affiliation ref="#struct-994"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Luc</forename>
                <surname>Pellissier</surname>
              </persName>
              <email type="md5">1788c552c9140c45cea2c810f0606783</email>
              <email type="domain">u-pec.fr</email>
              <idno type="idhal" notation="string">luc-pellissier</idno>
              <idno type="idhal" notation="numeric">141</idno>
              <idno type="halauthorid" notation="string">26474-141</idno>
              <affiliation ref="#struct-182989"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ulysse</forename>
                <surname>Léchine</surname>
              </persName>
              <idno type="idhal" notation="numeric">1372359</idno>
              <idno type="halauthorid" notation="string">2633992-1372359</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6384-0459</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">2018-11-14 11:06:45</date>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2021-01-23 16:57:00</date>
            </edition>
            <edition n="v3">
              <date type="whenSubmitted">2022-11-07 23:22:30</date>
            </edition>
            <edition n="v4">
              <date type="whenSubmitted">2023-02-10 14:24:23</date>
            </edition>
            <edition n="v5">
              <date type="whenSubmitted">2024-04-16 15:33:48</date>
            </edition>
            <edition n="v6">
              <date type="whenSubmitted">2024-10-14 16:29:16</date>
            </edition>
            <edition n="v7" type="current">
              <date type="whenSubmitted">2024-10-17 11:25:44</date>
              <date type="whenModified">2025-12-03 14:48:03</date>
              <date type="whenReleased">2024-10-21 12:01:44</date>
              <date type="whenProduced">2024-12</date>
              <date type="whenEndEmbargoed">2024-10-17</date>
              <ref type="file" target="https://hal.science/hal-01921942v7/document">
                <date notBefore="2024-10-17"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01921942v7/file/final.pdf" id="file-4741110-4128222">
                <date notBefore="2024-10-17"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1811.06787"/>
            </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-01921942</idno>
            <idno type="halUri">https://hal.science/hal-01921942</idno>
            <idno type="halBibtex">seiller:hal-01921942</idno>
            <idno type="halRefHtml">&lt;i&gt;Information and Computation&lt;/i&gt;, 2024, 301, pp.105232. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.ic.2024.105232"&gt;&amp;#x27E8;10.1016/j.ic.2024.105232&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Information and Computation, 2024, 301, pp.105232. &amp;#x27E8;10.1016/j.ic.2024.105232&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-4741110-4128222"/></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="LACL" corresp="UPEC">Laboratoire d'Algorithmique Complexité et Logique</idno>
            <idno type="stamp" n="OCA">Observatoire de la Cote d'Azur</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="UPEC" corresp="CV_UPEC">Université Paris-Est Créteil Val-de-Marne</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="GALILE" corresp="UNIV-PARIS13">Institut Galilée Université Paris 13</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>
            <idno type="stamp" n="TEST-UPEC-ODD" corresp="UPEC">TEST UPEC ODD</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Unifying lower bounds for algebraic machines, semantically</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-441569"/>
                  <affiliation ref="#struct-1000994"/>
                  <affiliation ref="#struct-994"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Luc</forename>
                    <surname>Pellissier</surname>
                  </persName>
                  <email type="md5">1788c552c9140c45cea2c810f0606783</email>
                  <email type="domain">u-pec.fr</email>
                  <idno type="idhal" notation="string">luc-pellissier</idno>
                  <idno type="idhal" notation="numeric">141</idno>
                  <idno type="halauthorid" notation="string">26474-141</idno>
                  <affiliation ref="#struct-182989"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ulysse</forename>
                    <surname>Léchine</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1372359</idno>
                  <idno type="halauthorid" notation="string">2633992-1372359</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6384-0459</idno>
                  <affiliation ref="#struct-1000994"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">14180</idno>
                <idno type="issn">0890-5401</idno>
                <idno type="eissn">1090-2651</idno>
                <title level="j">Information and Computation</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">301</biblScope>
                  <biblScope unit="pp">105232</biblScope>
                  <date type="datePub">2024-12</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1811.06787</idno>
              <idno type="doi">10.1016/j.ic.2024.105232</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.2.0"/>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.2.5"/>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.F.7.1"/>
              <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-ag">Mathematics [math]/Algebraic Geometry [math.AG]</classCode>
              <classCode scheme="halDomain" n="math.math-ds">Mathematics [math]/Dynamical Systems [math.DS]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>This paper presents a new abstract method for proving lower bounds in computational complexity. Based on the notion of topological and measurable entropy for dynamical systems, it is shown to generalise three previous lower bounds results from the literature in algebraic complexity. We use it to prove that maxflow, a Ptime complete problem, is not computable in polylogarithmic time on parallel random access machines (prams) working with real numbers. This improves, albeit slightly, on a result of Mulmuley since the class of machines considered extends the class “prams without bit operations”, making more precise the relationship between Mulmuley’s result and similar lower bounds on real prams.More importantly, we show our method captures previous lower bounds results from the literature, thus providing a unifying framework for "topological" proofs of lower bounds: Steele and Yao’s lower bounds for algebraic decision trees, Ben-Or’s lower bounds for algebraic computation trees, Cucker’s proof that NC is not equal to Ptime in the real case, and Mulmuley’s lower bounds for “prams without bit operations”.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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="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="laboratory" xml:id="struct-994" status="OLD">
          <orgName>Laboratoire d'Informatique de Paris-Nord</orgName>
          <orgName type="acronym">LIPN</orgName>
          <date type="end">2019-12-31</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 active="#struct-15786" type="direct"/>
            <relation active="#struct-301340" type="direct"/>
            <relation active="#struct-303171" type="direct"/>
            <relation name="UMR7030" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-182989" status="VALID">
          <idno type="IdRef">113845588</idno>
          <idno type="RNSR">200715457A</idno>
          <orgName>Laboratoire d'Algorithmique Complexité et Logique</orgName>
          <orgName type="acronym">LACL</orgName>
          <desc>
            <address>
              <addrLine>LACL, Université Paris-Est Créteil Val-de-Marne, 61 avenue du Général de Gaulle 94010 Créteil cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lacl.fr</ref>
          </desc>
          <listRelation>
            <relation name="EA4219" active="#struct-420786" type="direct"/>
          </listRelation>
        </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>
        <org type="institution" xml:id="struct-15786" status="VALID">
          <idno type="ROR">https://ror.org/05f82e368</idno>
          <orgName>Université Paris 13</orgName>
          <orgName type="acronym">UP13</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-paris13.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301340" status="VALID">
          <orgName>Institut Galilée</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-303171" status="VALID">
          <idno type="IdRef">19077990X</idno>
          <idno type="ROR">https://ror.org/001z21q04</idno>
          <orgName>Université Sorbonne Paris Cité</orgName>
          <orgName type="acronym">USPC</orgName>
          <date type="start">2010-01-01</date>
          <desc>
            <address>
              <addrLine>Université Sorbonne Paris Cité | 100-104, avenue de France | 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-paris-cite.fr/fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-420786" status="VALID">
          <idno type="IdRef">028021037</idno>
          <idno type="ISNI">0000000121497878</idno>
          <idno type="ROR">https://ror.org/05ggc9x40</idno>
          <orgName>Université Paris-Est Créteil Val-de-Marne - Paris 12</orgName>
          <orgName type="acronym">UPEC UP12</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>61 avenue du Général de Gaulle - 94010 Créteil cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-pec.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>