SIAM Journal on Computing · 1985 · 124 citations · 14 references
Natural SciencesMathematicsAlgebraNumber TheorySeparation Of PowersAlgebraic Number TheoryGalois TheoryAlgebraic Number ComputationAlgebraic Number Field ComputationsPolynomial DecompositionPolynomial Time ComplexityPolynomial-time AlgorithmsPolynomial-time ReductionsSplittingSplitting Fields
We show that if $f(x)$ is a polynomial in $Z [ \alpha ][ x ]$, where $\alpha $ satisfies a monic irreducible polynomial over Z, then $f(x)$ can be factored over $Q(\alpha )[ x ]$ in polynomial time. We also show that the splitting field of $f(x)$ can be determined in time polynomial in ([Splitting field of $f(x): Q $], $\log | (x) |$).
14
On Euclid's Algorithm and the Theory of Subresultants
Warren S. Brown, J. F. Traub · Journal of the ACM · 1971 · 258 citations · Full text