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.
math.NT↗
arXiv subjects
Publications and source records attributed to A. Steel.
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.