An Improved Multivariate Polynomial Factoring Algorithm

DOI10.2307/2006346zbMath0388.10035MaRDI QIDQ4168687

Paul S. Wang

Publication date: 1978

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

Mathematics Subject Classification ID

11C08: Polynomials in number theory

12E05: Polynomials in general fields (irreducibility, etc.)

11T06: Polynomials over finite fields

11-04: Software, source code, etc. for problems pertaining to number theory

12-04: Software, source code, etc. for problems pertaining to field theory

Related Items

Factoring multivariate polynomials via partial differential equations, Symbolic iterative algorithm for generalized inversion of rational polynomial matrices, Interpolating polynomials from their values, MACSYMA from F to G, Computer algebra: Past and future, A p-adic approach to the computation of Gröbner bases, Factoring multivariate integral polynomials, Computation of simple and group factors of multivariate polynomials, Massively parallel search for linear factors in polynomials with many variables, 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, An improved EZ-GCD algorithm for multivariate polynomials, Unnamed Item

Uses Software

• IBM Scratchpad
• MACSYMA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach to the symbolic factorization of multivariate polynomials
• On Hensel factorization. I
• An Inequality About Factors of Polynomials
• Multivariate Polynomial Factorization
• Factoring Multivariate Polynomials over Algebraic Number Fields
• On the Efficiency of Algorithms for Polynomial Factoring
• Factoring Polynomials Over Large Finite Fields