Factoring polynomials over global fields I

Authors:
Michael E. Pohst
Affiliations:
Technische Universität Berlin, Institut für Mathematik-MA 8-1, Straβe des 17. Juni 136, 10623 Berlin, Germany
Venue:
Journal of Symbolic Computation
Year:
2005

Citing 6
Cited 3

Products of polynomials and a priori estimates for coefficients in polynomial decompositions: a sharp result

Journal of Symbolic Computation
Factoring polynomials over algebraic number fields via norms

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Factoring Polynomials Over Algebraic Number Fields

ACM Transactions on Mathematical Software (TOMS)
Lattices and Factorization of Polynomials over Algebraic Number Fields

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
On Reconstruction of Algebraic Numbers

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Algebraic factoring and rational function integration

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

Factoring polynomials over local fields

Journal of Symbolic Computation
Lifting and recombination techniques for absolute factorization

Journal of Complexity
Factoring polynomials over global fields II

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.