An Improved Multivariate Polynomial Factoring Algorithm

From MaRDI portal
Publication:4168687

DOI10.2307/2006346zbMath0388.10035OpenAlexW4245298385MaRDI QIDQ4168687

Paul S. Wang

Publication date: 1978

Full work available at URL: https://doi.org/10.2307/2006346



Related Items

Factoring multivariate polynomials via partial differential equations, Factoring multivariate integral polynomials, Computer algebra: Past and future, Computation of simple and group factors of multivariate polynomials, Massively parallel search for linear factors in polynomials with many variables, A p-adic approach to the computation of Gröbner bases, An efficient algorithm for factoring polynomials over algebraic extension field, Parallelization of triangular decompositions: techniques and implementation, Unnamed Item, Massively parallel factorizations of polynomials with many non-commuting variables, A New Black Box Factorization Algorithm - the Non-monic Case, New Sparse Multivariate Polynomial Factorization Algorithms over Integers, Detecting and parametrizing polynomial surfaces without base points, Methodologies of Symbolic Computation, Interpolating polynomials from their values, Sparse bivariate polynomial factorization, A fast parallel sparse polynomial GCD algorithm, An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation, Symbolic iterative algorithm for generalized inversion of rational polynomial matrices, The complexity of sparse Hensel lifting and sparse polynomial factorization, An improved EZ-GCD algorithm for multivariate polynomials, Using Sparse Interpolation in Hensel Lifting, Enhancing the Extended Hensel Construction by Using Gröbner Bases, MACSYMA from F to G, Using sparse interpolation to solve multivariate diophantine equations


Uses Software


Cites Work