Strategy-Accurate Parallel Buchberger Algorithms.
We describe two parallel versions of the Buchberger algorithm for computing Gröbner bases, one for the general case and one for homogeneous ideals, which exploit coarse grain parallelism. For the general case, to avoid the growth in number and complexity of the polynomials to reduce, the algorithm a...
| Julkaisussa: | Journal of symbolic computation. 21, 4-6 (1996). |
|---|---|
| Päätekijä: | |
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |