Parallelization of matrix algorithms for Gröbner basis computation
From MaRDI portal
Publication:2452558
Cites work
- A new efficient algorithm for computing Gröbner bases (F₄)
- A parallel implementation of Buchberger's algorithm over \(\mathbb{Z}_p\) for \(p\leq 31991\)
- Efficiency estimate for distributed computation of Gröbner bases and involutive bases
- Fast search for the Janet divisor
- Gröbner bases and involutive methods for algebraic and differential equations
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 1263375 (Why is no real title available?)
- scientific article; zbMATH DE number 1163445 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 1418284 (Why is no real title available?)
- Involutive method for computing Gröbner bases over \(\mathbb F_2\)
- On an installation of Buchberger's algorithm
- Parallel algorithms for Gröbner-basis construction
- Parallelization of an algorithm for computation of involutive Janet bases
- Strategy-accurate parallel Buchberger algorithms
Cited in
(2)
This page was built for publication: Parallelization of matrix algorithms for Gröbner basis computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452558)