|
|
Fundamentalnaya i Prikladnaya Matematika, 2008, Volume 14, Issue 4, Pages 35–64
(Mi fpm1124)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Parallelization of matrix algorithms for Gröbner basis computation
D. E. Aleksandrov, V. V. Galkin, A. I. Zobnin, M. V. Levin M. V. Lomonosov Moscow State University
Abstract:
Sequential and parallel implementations of the F4 algorithm for computing Gröbner bases of polynomial ideals are discussed.
Citation:
D. E. Aleksandrov, V. V. Galkin, A. I. Zobnin, M. V. Levin, “Parallelization of matrix algorithms for Gröbner basis computation”, Fundam. Prikl. Mat., 14:4 (2008), 35–64; J. Math. Sci., 163:5 (2009), 469–486
Linking options:
https://www.mathnet.ru/eng/fpm1124 https://www.mathnet.ru/eng/fpm/v14/i4/p35
|
|