Factoring polynomials over global fields

Univariate Factoring Rational number Natural number
DOI: 10.5802/jtnb.655 Publication Date: 2011-09-13T08:31:36Z
ABSTRACT
We prove that van Hoeij's original algorithm to factor univariate polynomials over the rationals runs in polynomial time, as well natural variants. In particular, our approach also yields time complexity results for bivariate a finite field.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (0)
CITATIONS (22)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....