Massively parallel computations on many-variable polynomials

DOI10.1007/BF02127800zbMath0860.68002OpenAlexW2019604663MaRDI QIDQ1817071

Jean-Louis Frot, Christian Millour, Bernard Beauzamy

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

zbMATH Keywords

hypercubemultivariate homogeneous polynomial

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (7)

Massively parallel computation of many-variable polynomial interpolation ⋮ Massively parallel search for linear factors in polynomials with many variables ⋮ Massively parallel factorizations of polynomials with many non-commuting variables ⋮ Differential Identities ⋮ An Inequality for Products of Polynomials ⋮ Complexity of Bezout's theorem. VII: Distance estimates in the condition metric ⋮ Lower bounds for norms of products of polynomials via Bombieri inequality

Cites Work

• Products of polynomials in many variables
• Products of polynomials and a priori estimates for coefficients in polynomial decompositions: A sharp result
• A Self-Routing Benes Network and Parallel Permutation Algorithms

This page was built for publication: Massively parallel computations on many-variable polynomials