Factoring Multivariate Polynomials Over the Integers
From MaRDI portal
Publication:4068830
DOI10.2307/2005309zbMath0311.10052OpenAlexW4251629337MaRDI QIDQ4068830
Linda Preiss Rothschild, Paul S. Wang
Publication date: 1975
Full work available at URL: https://doi.org/10.2307/2005309
Polynomials in number theory (11C08) Polynomials in real and complex fields: factorization (12D05) Primes (11A41)
Related Items
Computing sparse GCD of multivariate polynomials via polynomial interpolation, Computer algebra: Past and future, Massively parallel search for linear factors in polynomials with many variables, Unnamed Item, A p-adic approach to the computation of Gröbner bases, Factorisation sur $\mathbb {Z}[X$ des polynômes de degré élevé à l’aide d’un monomorphisme], Hensel construction with an arbitrary degree of convergence, 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, Factoring multivariate polynomials represented by black boxes: a Maple + C implementation, Interpolating polynomials from their values, Macsyma: A personal history, Sparse bivariate polynomial factorization, Approximate factorization of multivariate polynomials and absolute irreducibility testing, A unified method for multivariate polynomial factorizations, An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation, Factorizations for \(n\)D polynomial matrices, The complexity of sparse Hensel lifting and sparse polynomial factorization, Using Sparse Interpolation in Hensel Lifting, Enhancing the Extended Hensel Construction by Using Gröbner Bases
Uses Software
Cites Work
