Factoring polynomials over global fields
Number Theory
2007-05-23 v1
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.
Cite
@article{arxiv.math/0409510,
title = {Factoring polynomials over global fields},
author = {K. Belabas and M. van Hoeij and J. Klueners and A. Steel},
journal= {arXiv preprint arXiv:math/0409510},
year = {2007}
}
Comments
10 pages