Factorization Algorithms over Number Fields
ROBLOT, Xavier-François
Institut Girard Desargues [IGD]
Théorie des Nombres et Algorithmique Arithmétique [A2X]
Institut Girard Desargues [IGD]
Théorie des Nombres et Algorithmique Arithmétique [A2X]
ROBLOT, Xavier-François
Institut Girard Desargues [IGD]
Théorie des Nombres et Algorithmique Arithmétique [A2X]
< Leer menos
Institut Girard Desargues [IGD]
Théorie des Nombres et Algorithmique Arithmétique [A2X]
Idioma
en
Article de revue
Este ítem está publicado en
Journal of Symbolic Computation. 2004, vol. 38, p. 1429-1443
Elsevier
Resumen en inglés
The aim of this paper is to describe two new factorization algorithms for polynomials. The first factorizes polynomials modulo the prime ideal of a number field. The second factorizes polynomials over a number field.
The aim of this paper is to describe two new factorization algorithms for polynomials. The first factorizes polynomials modulo the prime ideal of a number field. The second factorizes polynomials over a number field.< Leer menos
Orígen
Importado de HalCentros de investigación