Sciweavers

ANTS
2010
Springer
260views Algorithms» more  ANTS 2010»
13 years 8 months ago
On the Complexity of the Montes Ideal Factorization Algorithm
Let p be a rational prime and let Φ(X) be a monic irreducible polynomial in Z[X], with nΦ = deg Φ and δΦ = vp(disc Φ). In [13] Montes describes an algorithm for the decomposi...
David Ford, Olga Veres