Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
Journal of Symbolic Computation
An upper bound on the derivational complexity of Knuth--Bendix orderings
Information and Computation - Special issue: ICC '99
Computer algebra handbook
Hi-index | 0.00 |