---
res:
  bibo_abstract:
  - 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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Karim
      foaf_name: Belabas, Karim
      foaf_surname: Belabas
  - foaf_Person:
      foaf_givenName: Mark
      foaf_name: van Hoeij, Mark
      foaf_surname: van Hoeij
  - foaf_Person:
      foaf_givenName: Jürgen
      foaf_name: Klüners, Jürgen
      foaf_surname: Klüners
      foaf_workInfoHomepage: http://www.librecat.org/personId=21202
  - foaf_Person:
      foaf_givenName: Allan
      foaf_name: Steel, Allan
      foaf_surname: Steel
  bibo_doi: 10.5802/jtnb.655
  bibo_issue: '1'
  bibo_volume: 21
  dct_date: 2009^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1246-7405
  dct_language: eng
  dct_publisher: Cellule MathDoc/CEDRAM@
  dct_subject:
  - Algebra and Number Theory
  dct_title: Factoring polynomials over global fields@
...