Parallel modular computation of Gröbner and involutive bases

DOI10.1134/S0361768813020084zbMath1323.68631MaRDI QIDQ2017756

D. A. Yanovich

Publication date: 23 March 2015

Published in: Programming and Computer Software (Search for Journal in Brave)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Parallel algorithms in computer science (68W10)

Related Items (2)

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

Uses Software

• PoSSo

Cites Work

• Mapping integers and Hensel codes onto Farey fractions
• Modular algorithms for computing Gröbner bases.
• Involutive bases of polynomial ideals
• Parallelization of modular algorithms
• Parallel computation of Janet and Gröbner bases over rational numbers
• Involutive divisions of monomials

This page was built for publication: Parallel modular computation of Gröbner and involutive bases