Factoring Multivariate Polynomials Over the Integers

DOI10.2307/2005309MaRDI QIDQ4068830zbMATH OpenOpenAlexFDO

Authors Paul S. Wang, Linda Preiss Rothschild

Publication date 1975

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

Mathematics Subject Classification ID

Primes (11A41) Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05)

Cites work

• Factoring Polynomials Over Large Finite Fields
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Hensel factorization. I

Cited in

(25)

• Computer algebra: Past and future
• A p-adic approach to the computation of Gröbner bases
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Massively parallel search for linear factors in polynomials with many variables
• Massively parallel factorizations of polynomials with many non-commuting variables
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• Hensel construction with an arbitrary degree of convergence
• The complexity of sparse Hensel lifting and sparse polynomial factorization
• An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• Using sparse interpolation in Hensel lifting
• Enhancing the Extended Hensel Construction by Using Gröbner Bases
• Factorisation sur $\mathbb {Z}[X]$ des polynômes de degré élevé à l’aide d’un monomorphisme
• scientific article; zbMATH DE number 3660789 (Why is no real title available?)
• scientific article; zbMATH DE number 3687497 (Why is no real title available?)
• Sparse bivariate polynomial factorization
• Factorizations for nD polynomial matrices
• A New Black Box Factorization Algorithm - the Non-monic Case
• New Sparse Multivariate Polynomial Factorization Algorithms over Integers
• Macsyma: A personal history
• A unified method for multivariate polynomial factorizations
• Factoring sparse polynomials fast
• Symbolic mathematical computation 1965--1975. The view from a half-century perspective
• Symbolic mathematical computation 1965--1975: the emergence of a discipline
• Interpolating polynomials from their values

Describes a project that uses

Uses Software

• MACSYMA

This page was built for publication: Factoring Multivariate Polynomials Over the Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4068830)