Parallel computation of Gröbner bases on distributed memory machines
From MaRDI portal
Recommendations
Cited in
(11)- A parallel implementation of Buchberger's algorithm over \(\mathbb{Z}_p\) for \(p\leq 31991\)
- Parallel dynamic semantics of sequential programs with speculative and incremental computation
- Parallel algorithms for Gröbner-basis construction
- Parallel reduction of matrices in Gröbner bases computations
- scientific article; zbMATH DE number 47319 (Why is no real title available?)
- scientific article; zbMATH DE number 1254280 (Why is no real title available?)
- Efficient techniques for performing an irregular computation on distributed memory machines
- On the correctness of a distributed memory Gröbner basis algorithm
- Parallelization of perturbation analysis: Application to large-scale engineering problems
- A MIMD implementation of the Buchberger algorithm for Boolean polynomials
- Efficiency estimate for distributed computation of Gröbner bases and involutive bases
This page was built for publication: Parallel computation of Gröbner bases on distributed memory machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346478)