Sciweavers

6 search results - page 2 / 2
» On the Genericity of the Modular Polynomial GCD Algorithm
Sort
View
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
13 years 11 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie