Fast search for the Janet divisor
From MaRDI portal
Publication:5942048
DOI10.1023/A:1007130618376zbMath1024.13009MaRDI QIDQ5942048
Yu. A. Blinkov, Vladimir P. Gerdt, D. A. Yanovich
Publication date: 16 January 2002
Published in: Programming and Computer Software (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (10)
Involutive method for computing Gröbner bases over \(\mathbb F_2\) ⋮ Using dynamic memory reallocation in GInv ⋮ On constructivity of involutive divisions ⋮ Algorithmic Thomas decomposition of algebraic and differential systems ⋮ Involutive divisions and monomial orderings ⋮ Parallelization of matrix algorithms for Gröbner basis computation ⋮ Asymmetric approach to computation of Gröbner bases ⋮ Thomas Decomposition of Algebraic and Differential Systems ⋮ Involutive divisions: Slice and pair properties ⋮ On a method for finding the roots of an ideal
This page was built for publication: Fast search for the Janet divisor
