Factoring polynomials over global fields I

• Autores: Michael E. Pohst
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 39, Nº 6, 2005, págs. 617-630
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper we present a generic algorithm for factoring polynomials over global fields F. As efficient implementations of that algorithm for number fields and function fields differ substantially, these cases will be treated separately. Complexity issues and implementations will be discussed in part II which also contains illustrative examples.