Parallelization of matrix algorithms for Gröbner basis computation
From MaRDI portal
Publication:2452558
DOI10.1007/s10958-009-9685-7zbMath1288.13022OpenAlexW1971126251MaRDI QIDQ2452558
M. V. Levin, V. V. Galkin, A. I. Zobnin, Dmitriy E. Alexandrov
Publication date: 4 June 2014
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-009-9685-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Involutive method for computing Gröbner bases over \(\mathbb F_2\)
- Efficiency estimate for distributed computation of Gröbner bases and involutive bases
- On an installation of Buchberger's algorithm
- A parallel implementation of Buchberger's algorithm over \(\mathbb{Z}_p\) for \(p\leq 31991\)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Gröbner bases and involutive methods for algebraic and differential equations
- Parallelization of an algorithm for computation of involutive Janet bases
- Parallel algorithms for Gröbner-basis construction
- Strategy-accurate parallel Buchberger algorithms
- Fast search for the Janet divisor
This page was built for publication: Parallelization of matrix algorithms for Gröbner basis computation