Parallel modular computation of Gröbner and involutive bases
From MaRDI portal
Publication:2017756
Recommendations
Cites work
Cited in
(13)- Modular computations of standard bases for subalgebras
- Parallelization of modular algorithms
- Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
- Computation of involutive and Gröbner bases using the tableau representation of polynomials
- Using dynamic memory reallocation in GInv
- Involutive method for computing Gröbner bases over \(\mathbb F_2\)
- Modular algorithms for computing Gröbner bases.
- Parallel computation of Janet and Gröbner bases over rational numbers
- Parallel Processing and Applied Mathematics
- Parallelization of an algorithm for computation of involutive Janet bases
- Efficiency estimate for distributed computation of Gröbner bases and involutive bases
- scientific article; zbMATH DE number 5494047 (Why is no real title available?)
- Parallel algorithms for Gröbner-basis construction
This page was built for publication: Parallel modular computation of Gröbner and involutive bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017756)