<?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-04999406</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-04T09:02:25+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover</title>
            <author role="aut">
              <persName>
                <forename type="first">Florent</forename>
                <surname>Foucaud</surname>
              </persName>
              <email type="md5">1ed88a90117097c6e89b550284193171</email>
              <email type="domain">uca.fr</email>
              <idno type="idhal" notation="string">florent-foucaud</idno>
              <idno type="idhal" notation="numeric">169708</idno>
              <idno type="halauthorid" notation="string">20994-169708</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8198-693X</idno>
              <affiliation ref="#struct-1063677"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Esther</forename>
                <surname>Galby</surname>
              </persName>
              <idno type="halauthorid">3186582-0</idno>
              <affiliation ref="#struct-50877"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Liana</forename>
                <surname>Khazaliya</surname>
              </persName>
              <idno type="halauthorid">3186583-0</idno>
              <affiliation ref="#struct-19098"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Shaohua</forename>
                <surname>Li</surname>
              </persName>
              <idno type="halauthorid">1244341-0</idno>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Fionn Mc</forename>
                <surname>Inerney</surname>
              </persName>
              <idno type="halauthorid">3085185-0</idno>
              <affiliation ref="#struct-97998"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Roohani</forename>
                <surname>Sharma</surname>
              </persName>
              <idno type="halauthorid">2929442-0</idno>
              <affiliation ref="#struct-300728"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Prafullkumar</forename>
                <surname>Tale</surname>
              </persName>
              <idno type="halauthorid">2580663-0</idno>
              <affiliation ref="#struct-215188"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Florent</forename>
                <surname>Foucaud</surname>
              </persName>
              <email type="md5">1ed88a90117097c6e89b550284193171</email>
              <email type="domain">uca.fr</email>
            </editor>
            <funder ref="#projanr-55789"/>
            <funder ref="#projanr-49675"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2025-03-20 17:28:48</date>
              <date type="whenWritten">2023-07-16</date>
              <date type="whenModified">2026-02-07 05:30:42</date>
              <date type="whenReleased">2025-03-20 17:28:48</date>
              <date type="whenProduced">2023-07-16</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/2307.08149"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="150557">
                <persName>
                  <forename>Florent</forename>
                  <surname>Foucaud</surname>
                </persName>
                <email type="md5">1ed88a90117097c6e89b550284193171</email>
                <email type="domain">uca.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04999406</idno>
            <idno type="halUri">https://hal.science/hal-04999406</idno>
            <idno type="halBibtex">foucaud:hal-04999406</idno>
            <idno type="halRefHtml">2023</idno>
            <idno type="halRef">2023</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="PRES_CLERMONT">Université de Clermont</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIMOS" corresp="PRES_CLERMONT">Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes</idno>
            <idno type="stamp" n="CAP20-25" corresp="PRES_CLERMONT">I-Site CAP 20-25</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="CLERMONT-AUVERGNE-INP">Clermont Auvergne INP</idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Florent</forename>
                    <surname>Foucaud</surname>
                  </persName>
                  <email type="md5">1ed88a90117097c6e89b550284193171</email>
                  <email type="domain">uca.fr</email>
                  <idno type="idhal" notation="string">florent-foucaud</idno>
                  <idno type="idhal" notation="numeric">169708</idno>
                  <idno type="halauthorid" notation="string">20994-169708</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8198-693X</idno>
                  <affiliation ref="#struct-1063677"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Esther</forename>
                    <surname>Galby</surname>
                  </persName>
                  <idno type="halauthorid">3186582-0</idno>
                  <affiliation ref="#struct-50877"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Liana</forename>
                    <surname>Khazaliya</surname>
                  </persName>
                  <idno type="halauthorid">3186583-0</idno>
                  <affiliation ref="#struct-19098"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Shaohua</forename>
                    <surname>Li</surname>
                  </persName>
                  <idno type="halauthorid">1244341-0</idno>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Fionn Mc</forename>
                    <surname>Inerney</surname>
                  </persName>
                  <idno type="halauthorid">3085185-0</idno>
                  <affiliation ref="#struct-97998"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Roohani</forename>
                    <surname>Sharma</surname>
                  </persName>
                  <idno type="halauthorid">2929442-0</idno>
                  <affiliation ref="#struct-300728"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Prafullkumar</forename>
                    <surname>Tale</surname>
                  </persName>
                  <idno type="halauthorid">2580663-0</idno>
                  <affiliation ref="#struct-215188"/>
                </author>
              </analytic>
              <monogr>
                <imprint>
                  <date type="datePub">2023</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2307.08149</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</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>Treewidth (tw) is an important parameter that, when bounded, yields tractability for many problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and QUANTIFIED SAT or, more generally, QUANTIFIED CSP, are FPT parameterized by the tw of the input's (primal) graph plus the length of the MSO-formula [Courcelle, Information &amp;amp; Computation 1990] and the quantifier rank [Chen, ECAI 2004], resp. The algorithms from these (meta-)results have running times whose dependence on tw is a tower of exponents. A conditional lower bound by Fichte et al. [LICS 2020] shows that, for QUANTIFIED SAT, the height of this tower is equal to the number of quantifier alternations. Lower bounds showing that at least double-exponential factors in the running time are necessary are rare: there are very few (for tw and vertex cover vc parameterizations) and they are for problems that are complete for #NP, $Σ_2^p$, $Π_2^p$, or higher levels of the polynomial hierarchy. We show, for the first time, that it is not necessary to go higher up in the polynomial hierarchy to obtain such lower bounds. We design a novel, yet simple versatile technique based on Sperner families to obtain such lower bounds and apply it to 3 problems: METRIC DIMENSION, STRONG METRIC DIMENSION, and GEODETIC SET. We prove that they do not admit $2^{2^{o(tw)}} \cdot n^{O(1)}$-time algorithms, even on bounded diameter graphs, unless the ETH fails. For STRONG METRIC DIMENSION, the lower bound holds even for vc. We complement our lower bounds with matching upper bounds.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-1063677" status="VALID">
          <idno type="IdRef">155645919</idno>
          <idno type="RNSR">200212221E</idno>
          <idno type="ROR">00t3fpp34</idno>
          <orgName>Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes</orgName>
          <orgName type="acronym">LIMOS</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Universitaire des Cézeaux, 1 rue de la Chebarde, TSA 60125 / CS 60026, 63178 Aubière Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://limos.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR6158" active="#struct-359750" type="direct"/>
            <relation name="UMR6158" active="#struct-441569" type="direct"/>
            <relation name="UMR6158" active="#struct-1063463" type="direct"/>
            <relation name="UMR6158" active="#struct-1063539" type="direct"/>
            <relation active="#struct-1063463" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-50877" status="VALID">
          <orgName>Chalmers University of Technology [Göteborg]</orgName>
          <desc>
            <address>
              <addrLine>SE-412 96 Göteborg</addrLine>
              <country key="SE"/>
            </address>
            <ref type="url">http://www.chalmers.se/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-19098" status="VALID">
          <idno type="IdRef">030036496</idno>
          <idno type="ROR">https://ror.org/04d836q62</idno>
          <orgName>Vienna University of Technology = Technischen Universität Wien</orgName>
          <orgName type="acronym">TU Wien</orgName>
          <desc>
            <address>
              <addrLine>Karlsplatz 13, 1040 Vienna</addrLine>
              <country key="AT"/>
            </address>
            <ref type="url">https://www.tuwien.at/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-97998" status="VALID">
          <orgName>Telefonica Investigación y Desarrollo</orgName>
          <orgName type="acronym">Telefonica I+D</orgName>
          <desc>
            <address>
              <country key="ES"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-301486" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300728" status="VALID">
          <idno type="IdRef">026431637</idno>
          <idno type="ROR">https://ror.org/03zga2b32</idno>
          <orgName>University of Bergen</orgName>
          <orgName type="acronym">UiB</orgName>
          <desc>
            <address>
              <addrLine>Universitetet i Bergen | Postboks 7800, NO-5020 Bergen</addrLine>
              <country key="NO"/>
            </address>
            <ref type="url">https://www.uib.no/en</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-215188" status="VALID">
          <idno type="ROR">https://ror.org/028qa3n13</idno>
          <orgName>Indian Institute of Science Education and Research Pune</orgName>
          <orgName type="acronym">IISER Pune</orgName>
          <desc>
            <address>
              <addrLine>Pashan, Pune, Maharashtra 411021</addrLine>
              <country key="IN"/>
            </address>
            <ref type="url">http://www.iiserpune.ac.in/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-359750" status="VALID">
          <idno type="IdRef">028028694</idno>
          <orgName>Ecole Nationale Supérieure des Mines de St Etienne</orgName>
          <orgName type="acronym">ENSM ST-ETIENNE</orgName>
          <date type="start">1816-01-01</date>
          <desc>
            <address>
              <addrLine>158 Cour Fauriel, 42100 Saint-Étienne</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mines-stetienne.fr/</ref>
          </desc>
        </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="regroupinstitution" xml:id="struct-1063463" status="VALID">
          <idno type="IdRef">252404955</idno>
          <idno type="ISNI">0000000115480420</idno>
          <idno type="ROR">https://ror.org/01a8ajp46</idno>
          <orgName>Université Clermont Auvergne</orgName>
          <orgName type="acronym">UCA</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>49, bd François-Mitterrand / CS 60032 / 63001 Clermont-Ferrand Cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.uca.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-1063539" status="VALID">
          <idno type="IdRef">252428943</idno>
          <orgName>Institut national polytechnique Clermont Auvergne</orgName>
          <orgName type="acronym">INP Clermont Auvergne</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-1063463" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-301486" status="VALID">
          <orgName>Telefonica Group</orgName>
          <desc>
            <address>
              <country key="ES"/>
            </address>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-55789" status="VALID">
          <idno type="anr">ANR-21-CE48-0004</idno>
          <orgName>GRALMECO</orgName>
          <desc>Algorithmique des problèmes de couverture métriques dans les graphes</desc>
          <date type="start">2021</date>
        </org>
        <org type="anrProject" xml:id="projanr-49675" status="VALID">
          <idno type="anr">ANR-16-IDEX-0001</idno>
          <orgName>CAP 20-25</orgName>
          <desc>CAP 20-25</desc>
          <date type="start">2016</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>