An Improved Multivariate Polynomial Factoring Algorithm
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3265895 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3188124 (Why is no real title available?)
- A new approach to the symbolic factorization of multivariate polynomials
- An Inequality About Factors of Polynomials
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring Polynomials Over Large Finite Fields
- Multivariate Polynomial Factorization
- On Hensel factorization. I
- On the Efficiency of Algorithms for Polynomial Factoring
Cited in
(26)- Massively parallel factorizations of polynomials with many non-commuting variables
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
- Factoring sparse polynomials fast
- Detecting and parametrizing polynomial surfaces without base points
- The complexity of sparse Hensel lifting and sparse polynomial factorization
- Enhancing the Extended Hensel Construction by Using Gröbner Bases
- An improved EZ-GCD algorithm for multivariate polynomials
- A fast parallel sparse polynomial GCD algorithm
- Symbolic iterative algorithm for generalized inversion of rational polynomial matrices
- Massively parallel search for linear factors in polynomials with many variables
- A New Black Box Factorization Algorithm - the Non-monic Case
- Factoring multivariate polynomials via partial differential equations
- Using sparse interpolation in Hensel lifting
- Interpolating polynomials from their values
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers
- Factoring multivariate integral polynomials
- Using sparse interpolation to solve multivariate Diophantine equations
- Sparse bivariate polynomial factorization
- Computer algebra: Past and future
- Methodologies of Symbolic Computation
- scientific article; zbMATH DE number 3687497 (Why is no real title available?)
- MACSYMA from F to G
- An efficient algorithm for factoring polynomials over algebraic extension field
- Computation of simple and group factors of multivariate polynomials
- Parallelization of triangular decompositions: techniques and implementation
- A p-adic approach to the computation of Gröbner bases
This page was built for publication: An Improved Multivariate Polynomial Factoring Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168687)
