Extended parallelism in the Gröbner basis algorithm

DOI10.1007/BF01379314zbMath0788.68078OpenAlexW2079759748MaRDI QIDQ685087

Stephen A. Schwab

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

zbMATH Keywords

Gröbner basesparallelismshared memory multiprocessorsBuchberger algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Distributed algorithms (68W15)

Related Items (1)

Efficient techniques for performing an irregular computation on distributed memory machines

Uses Software

• PROTEUS

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extended parallelism in the Gröbner basis algorithm