<?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 inria-00524834v4</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-18T22:04:04+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Improved complexity bounds for real root isolation using Continued Fractions</title>
            <author role="aut">
              <persName>
                <forename type="first">Elias</forename>
                <surname>Tsigaridas</surname>
              </persName>
              <email type="md5">2574bcae9f1455fd6cf3833a1e5e5277</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">elias-tsigaridas</idno>
              <idno type="idhal" notation="numeric">690</idno>
              <idno type="halauthorid" notation="string">19773-690</idno>
              <affiliation ref="#struct-110223"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Elias</forename>
                <surname>Tsigaridas</surname>
              </persName>
              <email type="md5">2574bcae9f1455fd6cf3833a1e5e5277</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2010-10-08 20:05:40</date>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2010-10-09 01:09:22</date>
            </edition>
            <edition n="v3">
              <date type="whenSubmitted">2010-10-09 10:13:50</date>
            </edition>
            <edition n="v4" type="current">
              <date type="whenSubmitted">2011-06-01 18:48:41</date>
              <date type="whenWritten">2010</date>
              <date type="whenModified">2026-04-05 20:02:01</date>
              <date type="whenReleased">2011-06-07 09:07:43</date>
              <date type="whenProduced">2010-10-01</date>
              <date type="whenEndEmbargoed">2011-06-01</date>
              <ref type="file" target="https://inria.hal.science/inria-00524834v4/document">
                <date notBefore="2011-06-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/inria-00524834v4/file/CF.pdf" id="file-591567-786078">
                <date notBefore="2011-06-01"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1010.2006"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="114831">
                <persName>
                  <forename>Elias</forename>
                  <surname>Tsigaridas</surname>
                </persName>
                <email type="md5">2574bcae9f1455fd6cf3833a1e5e5277</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">inria-00524834</idno>
            <idno type="halUri">https://inria.hal.science/inria-00524834</idno>
            <idno type="halBibtex">tsigaridas:inria-00524834</idno>
            <idno type="halRefHtml">[Research Report] RR2010, Aarhus Universitet. 2010</idno>
            <idno type="halRef">[Research Report] RR2010, Aarhus Universitet. 2010</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-591567-786078"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="LARA">LARA</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">The improved bound bound that was claimed in an earlier version is removed, since there was an error in the proof.</note>
            <note type="report" n="6">Research Report</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Improved complexity bounds for real root isolation using Continued Fractions</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Elias</forename>
                    <surname>Tsigaridas</surname>
                  </persName>
                  <email type="md5">2574bcae9f1455fd6cf3833a1e5e5277</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">elias-tsigaridas</idno>
                  <idno type="idhal" notation="numeric">690</idno>
                  <idno type="halauthorid" notation="string">19773-690</idno>
                  <affiliation ref="#struct-110223"/>
                </author>
              </analytic>
              <monogr>
                <idno type="reportNumber">RR2010</idno>
                <imprint>
                  <date type="datePub">2010-10-01</date>
                </imprint>
                <authority type="institution">Aarhus Universitet</authority>
              </monogr>
              <idno type="arxiv">1010.2006</idno>
              <relatedItem target="https://hal.science/hal-04223513v1" type="IsDescribedBy" subtype="http://purl.org/coar/resource_type/c_6501"/>
              <relatedItem target="https://hal.science/hal-04223513v1" type="IsDescribedBy" subtype="http://purl.org/coar/resource_type/c_6501"/>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">real root isolation</term>
                <term xml:lang="en">continued fraction</term>
                <term xml:lang="en">real root problem</term>
                <term xml:lang="en">separation bound</term>
                <term xml:lang="en">polynomial</term>
              </keywords>
              <classCode scheme="acm" n="F.2">F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY</classCode>
              <classCode scheme="halDomain" n="info.info-sc">Computer Science [cs]/Symbolic Computation [cs.SC]</classCode>
              <classCode scheme="halTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halOldTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halTreeTypology" n="REPORT.RESREPORT">Reports - Research report</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real roots of univariate polynomials. This allows us to derive a worst case bound of $\sOB( d^6 + d^4\tau^2 + d^3\tau^2)$ for isolating the real roots of a polynomial with integer coefficients using the classic variant \cite{Akritas:implementation} of CF, where $d$ is the degree of the polynomial and $\tau$ the maximum bitsize of its coefficients. This improves the previous bound of Sharma \cite{sharma-tcs-2008} by a factor of $d^3$ and matches the bound derived by Mehlhorn and Ray \cite{mr-jsc-2009} for another variant of CF; it also matches the worst case bound of the subdivision-based solvers.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-110223" status="VALID">
          <orgName>Department of Computer Science [Aarhus]</orgName>
          <desc>
            <address>
              <addrLine>Department of Computer Science Aarhus University Åbogade 34 DK-8200 Aarhus N Denmark</addrLine>
              <country key="DK"/>
            </address>
            <ref type="url">http://www.cs.au.dk/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-19908" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-19908" status="VALID">
          <idno type="IdRef">026461307</idno>
          <idno type="ROR">https://ror.org/01aj84f44</idno>
          <orgName>Aarhus University [Aarhus]</orgName>
          <desc>
            <address>
              <addrLine>Nordre Ringgade 1 DK-8000 Aarhus C</addrLine>
              <country key="DK"/>
            </address>
            <ref type="url">http://www.au.dk/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>