Loading [MathJax]/extensions/MathZoom.js
A Fast Algorithm for Polynomial Factorization over ℚp
Ford, David ; Pauli, Sebastian ; Roblot, Xavier-François
HAL, hal-00863082 / Harvested from HAL
Text on HAL
We present an algorithm that returns a proper factorization of a polynomial Φ(x) over the p-adic integers ℤp (if Φ(x) is reducible over ℚp) or returns a power basis of the ring of integers of ℚp[x]/Φ(x)ℚp[x] (if Φ(x) is irreducible over ℚp). Our algorithm is based on the Round Four maximal order algorithm. Experimental results show that the new algorithm is considerably faster than the Round Four algorithm.
Publié le : 2002-07-05
Classification:  [MATH.MATH-NT]Mathematics [math]/Number Theory [math.NT] 
@article{hal-00863082,
     author = {Ford, David and Pauli, Sebastian and Roblot, Xavier-Fran\c cois},
     title = {A Fast Algorithm for Polynomial Factorization over $\mathbb{Q}$p},
     journal = {HAL},
     volume = {2002},
     number = {0},
     year = {2002},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00863082}
}

Ford, David; Pauli, Sebastian; Roblot, Xavier-François. A Fast Algorithm for Polynomial Factorization over ℚp. HAL, Tome 2002 (2002) no. 0, . http://gdmltest.u-ga.fr/item/hal-00863082/