scientific article; zbMATH DE number 1253993
The author presents an improvement of Trager's algorithm for factoring polynomials \(F\) over algebraic number fields \(K= \mathbb{Q}(\alpha)\). The key idea is to discard superfluous \(\text{mod }p\) factors in the factorization of the norm \(N(F)\) of \(F\) modulo \(a\) prime number \(p\) by taking into account the \(\text{mod }p\) factorization of the minimal polynomial \(M\) of \(a\) as well. A detailed description of the implementation of the new algorithm is included. The computation times of various examples indicate the superiority of the new method. For the entire collection see [Zbl 0903.00082].
- Factoring Polynomials over Algebraic Number Fields
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Using Gröbner bases for factoring polynomials over algebraic extension fields
- An efficient algorithm for factoring polynomials over algebraic extension field
- Factoring polynomials over global fields. I
- Factoring polynomials over global fields. I
- A parallel multi-modular algorithm for computing Lagrange resolvents
- Erratum: Factoring Polynomials over Algebraic Number Fields
- A Hybrid Approach for Normal Factorization of Polynomials
- An efficient algorithm for factoring polynomials over algebraic extension field
- Factoring Polynomials over Algebraic Number Fields
- scientific article; zbMATH DE number 1253995 (Why is no real title available?)
- scientific article; zbMATH DE number 1322495 (Why is no real title available?)
- scientific article; zbMATH DE number 2151340 (Why is no real title available?)
- Using Gröbner bases for factoring polynomials over algebraic extension fields
- Trager's factorization algorithm over successive extension fields
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 Q4226973)
