Paper Info
Title
An algorithm to compute the kernel of a derivation up to a certain degree
Abstract
An algorithm is described which computes generators of the kernel of derivations on k [ X 1 , . . . , X n ] up to a previously given bound. For w -homogeneous derivations it is shown that if the algorithm computes a generating set for the kernel, then this set is minimal.
Year
DOI
Venue
2000
10.1006/jsco.1999.0334
Journal of Symbolic Computation
Keywords
DocType
Volume
certain degree
Journal
29
Issue
ISSN
Citations 
6
Journal of Symbolic Computation
1
PageRank 
References 
Authors
0.41
0
1
Name
Order
Citations
PageRank
Stefan Maubach161.58