GAP
Project repository
Polynomial Factorization and Gcd
Need
:
3
Time
:
3
Component
:
Number Theory
Contact
: Alexander Hulpke
(
hulpke@math.colostate.edu
)
Last Update: 2004/5/29
Math
:
3
Program
:
4
Description
There are (better) algorithms for
Gcd over algebraic extensions of Q (Encarnacion)
Factorization of polynomials over Q (van Hoeij)
Factorization of polynomials over local fields
It would be useful to have these available.
References
M. J. Encarnaci\'on, J. Symbolic Comput. {\bf 20} (1995), no.~3, 299--313; MR 97c:11117
H. Cohen, {\it A course in computational algebraic number theory}, Springer, Berlin, 1993; MR 94i:11105
M. v.Hoeij, {\it Factoring Polynomials and the knapsack problem},
see here
.
S. Pauli, Factoring Polynomials over local fields, J.Symb.Comp. 32 (2001), 533-547
Remarks
Rudimentary multivariate factorization will be available in 4.5.
GAP
home page