On the correctness of a distributed memory Gröbner basis algorithm

DOI10.1007/978-3-662-21551-7_7zbMATH Open1503.68308OpenAlexW1591006157MaRDI QIDQ5055786FDOQ5055786

Authors: Soumen Chakrabarti, Katherine A. Yelick 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-21551-7_7

Recommendations

• Parallel computation of Gröbner bases on distributed memory machines
• Extended parallelism in the Gröbner basis algorithm
• Parallel algorithms for Gröbner-basis construction
• A MIMD implementation of the Buchberger algorithm for Boolean polynomials
• Strategy-accurate parallel Buchberger algorithms

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) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Proving termination with multiset orderings
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Notes on Gröbner bases
• Parallel processors and systems for algebraic manipulation: current work
• Parallelizing the closure computation in automated deduction
• Strategy-accurate parallel Buchberger algorithms
• Title not available (Why is that?)
• On the correctness of a distributed memory Gröbner basis algorithm

Cited In (1)

• On the correctness of a distributed memory Gröbner basis algorithm

Uses Software

• Maple
• UNITY

This page was built for publication: On the correctness of a distributed memory Gröbner basis algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055786)