K. Belabas

Factoring polynomials over global fields

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.