Factoring polynomials over global fields

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.

10 pages

Cited by in corpus (3)

• Bounds on Factors in Z[x]
• Gradual sub-lattice reduction and a new complexity for factoring polynomials
• Modular Las Vegas Algorithms for Polynomial Absolute Factorization