Massively parallel search for linear factors in polynomials with many variables
From MaRDI portal
(Redirected from Publication:1366832)
Search for all linear factors in a multi-variate polynomial of degree \(m\) with \(N\) variables. Theory how to find them by recursive polynomial reductions. Parallelization by distributing the work to free processors. Acceptable efficiency only for number of processors \(p <m\). Implementation with message passing on a CM5 (not using the vector units).
Recommendations
Cites work
- An Improved Multivariate Polynomial Factoring Algorithm
- Differential Identities
- Factoring Multivariate Polynomials Over the Integers
- Factoring Polynomials Over Large Finite Fields
- Massively parallel computation of many-variable polynomial interpolation
- Massively parallel computations on many-variable polynomials
- On Hensel factorization. I
- Products of polynomials in many variables
Cited in
(4)- Intrinsically parallel solution of systems of linear partial differential equations
- Massively parallel factorizations of polynomials with many non-commuting variables
- Massively parallel computations on many-variable polynomials
- Semi-numerical absolute factorization of polynomials with integer coefficients
This page was built for publication: Massively parallel search for linear factors in polynomials with many variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366832)