Massively parallel computations on many-variable polynomials
From MaRDI portal
Publication:1817071
DOI10.1007/BF02127800zbMATH Open0860.68002OpenAlexW2019604663MaRDI QIDQ1817071FDOQ1817071
Authors: Bernard Beauzamy, Jean-Louis Frot, Christian Millour
Publication date: 1 December 1996
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02127800
Recommendations
- Massively parallel computation of many-variable polynomial interpolation
- On the parallel evaluation of multivariate polynomials
- Massively parallel factorizations of polynomials with many non-commuting variables
- Very Fast Parallel Polynomial Arithmetic
- Massively parallel search for linear factors in polynomials with many variables
- scientific article; zbMATH DE number 18647
- On parallel evaluation of certain classes of polynomials with an increasing number of variables
- scientific article
- Parallel computation of determinants of matrices with polynomial entries
- scientific article
Cites Work
Cited In (9)
- Massively parallel factorizations of polynomials with many non-commuting variables
- Lower bounds for norms of products of polynomials via Bombieri inequality
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
- An Inequality for Products of Polynomials
- Parallel Homotopy Algorithms to Solve Polynomial Systems
- Massively parallel computation of many-variable polynomial interpolation
- Massively parallel search for linear factors in polynomials with many variables
- Complexity of Bezout's theorem. VII: Distance estimates in the condition metric
- Differential Identities
This page was built for publication: Massively parallel computations on many-variable polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817071)