Computer Algebra: Past and Future
Journal of Symbolic Computation
The computation of polynomial greatest common divisors over an algebraic number field
Journal of Symbolic Computation
Computing primitive elements of extension fields
Journal of Symbolic Computation
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Inversion in finite fields using logarithmic depth
Journal of Symbolic Computation
Factoring bivariate sparse (lacunary) polynomials
Journal of Complexity
Computational complexity of sentences over fields
Information and Computation
The number of roots of a lacunary bivariate polynomial on a line
Journal of Symbolic Computation
Detecting lacunary perfect powers and computing their roots
Journal of Symbolic Computation
Testing nilpotence of galois groups in polynomial time
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
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) |$).