<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Factoring polynomials over global fields</title></titleInfo>


<note type="publicationStatus">published</note>



<name type="personal">
  <namePart type="given">Karim</namePart>
  <namePart type="family">Belabas</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Mark</namePart>
  <namePart type="family">van Hoeij</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Jürgen</namePart>
  <namePart type="family">Klüners</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">21202</identifier></name>
<name type="personal">
  <namePart type="given">Allan</namePart>
  <namePart type="family">Steel</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">102</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">We prove that van Hoeij’s original algorithm to factor univariate polynomials over the rationals runs in polynomial time, as well as natural variants. In particular, our approach also yields polynomial time complexity results for bivariate polynomials over a finite field.</abstract>

<originInfo><publisher>Cellule MathDoc/CEDRAM</publisher><dateIssued encoding="w3cdtf">2009</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>

<subject><topic>Algebra and Number Theory</topic>
</subject>


<relatedItem type="host"><titleInfo><title>Journal de Théorie des Nombres de Bordeaux</title></titleInfo>
  <identifier type="issn">1246-7405</identifier>
  <identifier type="arXiv">math/0409510 </identifier><identifier type="doi">10.5802/jtnb.655</identifier>
<part><detail type="volume"><number>21</number></detail><detail type="issue"><number>1</number></detail><extent unit="pages">15-39</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<short>K. Belabas, M. van Hoeij, J. Klüners, A. Steel, Journal de Théorie Des Nombres de Bordeaux 21 (2009) 15–39.</short>
<chicago>Belabas, Karim, Mark van Hoeij, Jürgen Klüners, and Allan Steel. “Factoring Polynomials over Global Fields.” &lt;i&gt;Journal de Théorie Des Nombres de Bordeaux&lt;/i&gt; 21, no. 1 (2009): 15–39. &lt;a href=&quot;https://doi.org/10.5802/jtnb.655&quot;&gt;https://doi.org/10.5802/jtnb.655&lt;/a&gt;.</chicago>
<ieee>K. Belabas, M. van Hoeij, J. Klüners, and A. Steel, “Factoring polynomials over global fields,” &lt;i&gt;Journal de Théorie des Nombres de Bordeaux&lt;/i&gt;, vol. 21, no. 1, pp. 15–39, 2009, doi: &lt;a href=&quot;https://doi.org/10.5802/jtnb.655&quot;&gt;10.5802/jtnb.655&lt;/a&gt;.</ieee>
<apa>Belabas, K., van Hoeij, M., Klüners, J., &amp;#38; Steel, A. (2009). Factoring polynomials over global fields. &lt;i&gt;Journal de Théorie Des Nombres de Bordeaux&lt;/i&gt;, &lt;i&gt;21&lt;/i&gt;(1), 15–39. &lt;a href=&quot;https://doi.org/10.5802/jtnb.655&quot;&gt;https://doi.org/10.5802/jtnb.655&lt;/a&gt;</apa>
<bibtex>@article{Belabas_van Hoeij_Klüners_Steel_2009, title={Factoring polynomials over global fields}, volume={21}, DOI={&lt;a href=&quot;https://doi.org/10.5802/jtnb.655&quot;&gt;10.5802/jtnb.655&lt;/a&gt;}, number={1}, journal={Journal de Théorie des Nombres de Bordeaux}, publisher={Cellule MathDoc/CEDRAM}, author={Belabas, Karim and van Hoeij, Mark and Klüners, Jürgen and Steel, Allan}, year={2009}, pages={15–39} }</bibtex>
<ama>Belabas K, van Hoeij M, Klüners J, Steel A. Factoring polynomials over global fields. &lt;i&gt;Journal de Théorie des Nombres de Bordeaux&lt;/i&gt;. 2009;21(1):15-39. doi:&lt;a href=&quot;https://doi.org/10.5802/jtnb.655&quot;&gt;10.5802/jtnb.655&lt;/a&gt;</ama>
<mla>Belabas, Karim, et al. “Factoring Polynomials over Global Fields.” &lt;i&gt;Journal de Théorie Des Nombres de Bordeaux&lt;/i&gt;, vol. 21, no. 1, Cellule MathDoc/CEDRAM, 2009, pp. 15–39, doi:&lt;a href=&quot;https://doi.org/10.5802/jtnb.655&quot;&gt;10.5802/jtnb.655&lt;/a&gt;.</mla>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>34889</recordIdentifier><recordCreationDate encoding="w3cdtf">2022-12-23T09:33:37Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2023-03-06T09:09:56Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
