<?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-01905627</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-21T10:21:53+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis</title>
            <author role="aut">
              <persName>
                <forename type="first">Tomoyuki</forename>
                <surname>Yamakami</surname>
              </persName>
              <email type="md5">3645de84645560c7d6fb3a48ec2a54eb</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="numeric">1038030</idno>
              <idno type="halauthorid" notation="string">1083825-1038030</idno>
              <affiliation ref="#struct-473261"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-10-26 08:01:10</date>
              <date type="whenModified">2018-10-26 08:05:09</date>
              <date type="whenReleased">2018-10-26 08:05:09</date>
              <date type="whenProduced">2018-07-25</date>
              <date type="whenEndEmbargoed">2021-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01905627v1/document">
                <date notBefore="2021-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01905627v1/file/470153_1_En_20_Chapter.pdf" id="file-1905627-1936124">
                <date notBefore="2021-01-01"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1811.06336"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01905627</idno>
            <idno type="halUri">https://inria.hal.science/hal-01905627</idno>
            <idno type="halBibtex">yamakami:hal-01905627</idno>
            <idno type="halRefHtml">&lt;i&gt;20th International Conference on Descriptional Complexity of Formal Systems (DCFS)&lt;/i&gt;, Jul 2018, Halifax, NS, Canada. pp.237-249, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-94631-3_20"&gt;&amp;#x27E8;10.1007/978-3-319-94631-3_20&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.237-249, &amp;#x27E8;10.1007/978-3-319-94631-3_20&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1905627-1936124"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC1" corresp="IFIP-TC">IFIP TC1: Foundations of Computer Science</idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-DCFS" corresp="IFIP">Descriptional Complexity of Formal Systems</idno>
            <idno type="stamp" n="IFIP-WG1-2" corresp="IFIP-WG">WG 1.2: Descriptional Complexity</idno>
            <idno type="stamp" n="IFIP-LNCS-10952" corresp="IFIP-LNCS">Descriptional Complexity of Formal Systems</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Tomoyuki</forename>
                    <surname>Yamakami</surname>
                  </persName>
                  <email type="md5">3645de84645560c7d6fb3a48ec2a54eb</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="numeric">1038030</idno>
                  <idno type="halauthorid" notation="string">1083825-1038030</idno>
                  <affiliation ref="#struct-473261"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>20th International Conference on Descriptional Complexity of Formal Systems (DCFS)</title>
                  <date type="start">2018-07-25</date>
                  <date type="end">2018-07-27</date>
                  <settlement>Halifax, NS</settlement>
                  <country key="CA">Canada</country>
                </meeting>
                <editor>Stavros Konstantinidis</editor>
                <editor>Giovanni Pighizzini</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Descriptional Complexity of Formal Systems</biblScope>
                  <biblScope unit="volume">LNCS-10952</biblScope>
                  <biblScope unit="pp">237-249</biblScope>
                  <date type="datePub">2018</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-94631-3_20</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The linear space hypothesis is a practical working hypothesis, which originally states the insolvability of a restricted 2CNF Boolean formula satisfiability problem parameterized by the number of Boolean variables. From this hypothesis, it follows that the degree-3 directed graph connectivity problem (3DSTCON) parameterized by the number of vertices in a given graph cannot belong to PsubLIN, composed of decision problems computable by polynomial-time, sub-linear-space deterministic Turing machines. This hypothesis immediately implies L$$\ne $$NL and it was used as a solid foundation to obtain new lower bounds on the computational complexity of various NL search and NL optimization problems. The state complexity of transformation refers to the cost of converting one type of finite automata to another type, where the cost is measured in terms of the increase of the number of inner states of the converted automata from that of the original automata. We relate the linear space hypothesis to the state complexity of transforming restricted 2-way nondeterministic finite automata to computationally equivalent 2-way alternating finite automata having narrow computation graphs. For this purpose, we present state complexity characterizations of 3DSTCON and PsubLIN. We further characterize a non-uniform version of the linear space hypothesis in terms of the state complexity of transformation.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">WG 1.2</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-473261" status="VALID">
          <orgName>University of Fukui [Bunkyo]</orgName>
          <date type="start">2016-11-25</date>
          <desc>
            <address>
              <country key="JP"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>