The construction of maximal orders over a Dedekind domain
Journal of Symbolic Computation
Algorithmic algebraic number theory
Algorithmic algebraic number theory
Asymptotically fast triangularization of matrices over rings
SIAM Journal on Computing
A course in computational algebraic number theory
A course in computational algebraic number theory
Subquadratic-time factoring of polynomials over finite fields
Mathematics of Computation
Modern computer algebra
Factoring Polynominals over p-Adic Fields
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
On Reconstruction of Algebraic Numbers
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Algebraic factoring and rational function integration
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
On the computation of the maximal order in a dedekind domain.
On the computation of the maximal order in a dedekind domain.
Factoring polynomials over global fields I
Journal of Symbolic Computation
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Efficient computation of maximal orders in radical (including Kummer) extensions
Journal of Symbolic Computation
Single-factor lifting and factorization of polynomials over local fields
Journal of Symbolic Computation
Factoring polynomials over Z4 and over certain Galois rings
Finite Fields and Their Applications
| Hi-index | 0.00 |
We describe an efficient new algorithm for factoring a polynomial (x) over a field k that is complete with respect to a discrete prime divisor. For every irreducible factor (x) of (x) this algorithm returns an integral basis for k[ x ]/(x)k[ x ] over k. Copyright 2001 Academic Press.