Massively parallel search for linear factors in polynomials with many variables

DOI10.1016/S0096-3003(96)00138-5zbMath0880.65021OpenAlexW2083618247MaRDI QIDQ1366832

Jean-Christophe Hohl

Publication date: 22 January 1998

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(96)00138-5

zbMATH Keywords

parallel computationpolynomiallinear factorsrecursive polynomial reductions

Mathematics Subject Classification ID

Related Items (2)

Semi-numerical absolute factorization of polynomials with integer coefficients ⋮ Intrinsically parallel solution of systems of linear partial differential equations

Cites Work

• Products of polynomials in many variables
• Massively parallel computation of many-variable polynomial interpolation
• Massively parallel computations on many-variable polynomials
• On Hensel factorization. I
• Factoring Multivariate Polynomials Over the Integers
• An Improved Multivariate Polynomial Factoring Algorithm
• Differential Identities
• Factoring Polynomials Over Large Finite Fields

This page was built for publication: Massively parallel search for linear factors in polynomials with many variables