scientific article; zbMATH DE number 4069018
[For the entire collection see Zbl 0635.00018.] The authors give an overview on methods for factorizing polynomials with (algebraic) integer coefficients. If the polynomial coefficients are rational integers this problem can indeed be solved efficiently by factoring the polynomial modulo a suitable (small) prime number p, lifting coprime factors by Hensel's lemma to a sufficiently large power of p - say \(p^ n\)- and testing whether any of the factors modulo \(p^ n\) yields a factor over the rational integers. Factoring in algebraic number fields is much more complicated. The authors discuss various methods developed recently which mostly generalize the methods applied over the rational integers. It seems that every proposed algorithm is not very efficient for certain specific polynomials. One major difficulty arises for example, if an integral basis of the field under consideration is not known. Hence, there is still need for a good general factoring algorithm over algebraic number fields. The paper contains an extensive bibliography on that subject which is about complete up to 1986.
- On polynomial factorization
- Algorithms related to the decomposition of polynomials
- Incomplete factorization and GCD techniques
- Polynomial factorization algorithms over number fields
- Slip and slide method of factoring trinomials with integer coefficients over the integers
- scientific article; zbMATH DE number 1799292 (Why is no real title available?)
- scientific article; zbMATH DE number 4145747 (Why is no real title available?)
- An efficient algorithm for factoring polynomials over algebraic extension field
- Factoring Polynomials over Algebraic Number Fields
- Factoring with Cyclotomic Polynomials
- scientific article; zbMATH DE number 15339 (Why is no real title available?)
- Factorization of Prime Ideal Extensions in Number Rings
- Factorisation of polynomials
- Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields
- Newton polygons of higher order in algebraic number theory
- Polynomial factorization: Sharp bounds, efficient algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801671)