Factoring polynomials over global fields

2004/09/27 by K. Belabas, Karim Belabas, M. van Hoeij +9
Computer Science · Mathematics · #11Y16 #Algebraic Geometry and Number Theory #Coding theory and cryptography #FOS: Mathematics #Number Theory (math.NT) #Polynomial and algebraic computation #math.NT #msc:11Y16

paper · pdf · doi:10.48550/arxiv.math/0409510

10 pages

arxiv created 2004/09/27 · openalex publication_date 2004/09/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

Related

• Factorising Polynomials over Finite Fields
• Factoring polynomials over function fields
• Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields
• Single-factor lifting and factorization of polynomials over local fields
• Trading GRH for algebra: algorithms for factoring polynomials and related structures