An efficient algorithm for factoring polynomials over algebraic extension field
From MaRDI portal
Abstract: A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra Groebner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a polynomial over the ground field by a generic linear map. Then this polynomial is factorized over the ground field. From these factors, the factorization of the polynomial over the extension field is obtained. The new algorithm has been implemented and computer experiments indicate that the new algorithm is very efficient, particularly in complicated examples.
Recommendations
Cites work
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3823145 (Why is no real title available?)
- scientific article; zbMATH DE number 3785004 (Why is no real title available?)
- scientific article; zbMATH DE number 15339 (Why is no real title available?)
- scientific article; zbMATH DE number 1253993 (Why is no real title available?)
- scientific article; zbMATH DE number 1057759 (Why is no real title available?)
- scientific article; zbMATH DE number 2221412 (Why is no real title available?)
- A remark on factorisation
- Algorithms for polynomial GCD computation over algebraic function fields
- An Improved Multivariate Polynomial Factoring Algorithm
- Basic principles of mechanical theorem proving in elementary geometries
- Computing GCDs of polynomials over algebraic number fields
- Computing the primary decomposition of zero-dimensional ideals
- Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring Polynomials over Algebraic Number Fields
- Factoring polynomials with rational coefficients
- Implementation of prime decomposition of polynomial ideals over small finite fields
- On the theory of resolvents and its applications.
- Polynomial factorisation: an exploration of Lenstra's algorithm
- Primary decomposition of zero-dimensional ideals over finite fields
- The computation of polynomial greatest common divisors over an algebraic number field
- Trager's factorization algorithm over successive extension fields
Cited in
(14)- scientific article; zbMATH DE number 1643926 (Why is no real title available?)
- scientific article; zbMATH DE number 4208240 (Why is no real title available?)
- Trager's factorization algorithm over successive extension fields
- Improving the algorithms of Berlekamp and Niederreiter for factoring polynomials over finite fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- An algorithm for polynomial multiplication that does not depend on the ring constants
- Multiplicity-preserving triangular set decomposition of two polynomials
- A new efficient factorization algorithm for polynomials over small finite fields
- scientific article; zbMATH DE number 1273636 (Why is no real title available?)
- On a New Factorization Algorithm for Polynomials Over Finite Fields
- Algorithms for adaptive factorization of polynomials
- scientific article; zbMATH DE number 3968702 (Why is no real title available?)
- Using Gröbner bases for factoring polynomials over algebraic extension fields
This page was built for publication: An efficient algorithm for factoring polynomials over algebraic extension field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q365855)
