Parallel Algorithms for Groebner-Basis Reduction
Technical rept. 7 Aug 1984-6 Aug 1987
CALIFORNIA UNIV BERKELEY DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE
Pagination or Media Count:
A variety of ways is presented to parallelize Groebner-basis reduction, ranging from incorrect to ineffectual. The superiority is demonstrated of the method used by Zacharias, which is not readily parallelizable. The efficiency issues of generating reduced Groebner-bases, is discussed. Keywords Algorithms design Computer algebra Groebner bases parallel computation polynomial ideals simplification.
- Theoretical Mathematics