Extended parallelism in the Gröbner basis algorithm
From MaRDI portal
Publication:685087
DOI10.1007/BF01379314zbMath0788.68078MaRDI QIDQ685087
Publication date: 30 September 1993
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01379314
68W30: Symbolic computation and algebraic computation
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
68W15: Distributed algorithms
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- On an installation of Buchberger's algorithm
- Notes on Gröbner bases
- The complexity of the word problems for commutative semigroups and polynomial ideals
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs