Title  Complexity of a standard basis of a $D$module. 
Author(s)  A.L. Chistov, Dima Grigoriev 
Type  Article in Journal 
Abstract  A doubleexponential upper bound is obtained for the degree and for the complexity of constructing a standard basis of a $ D$module. This generalizes a wellknown bound for the complexity of a Gröbner basis of a module over the algebra of polynomials. It should be emphasized that the bound obtained cannot be deduced immediately from the commutative case. To get the bound in question, a new technique is developed for constructing all the solutions of a linear system over a homogeneous version of a Weyl algebra. 
ISSN  10610022; 15477371/e 
File 

URL 
http://www.ams.org/journals/spmj/20092005/S1061002209010693/home.html 
Language  English 
Journal  St. Petersbg. Math. J. 
Volume  20 
Number  5 
Pages  709736 
Publisher  American Mathematical Society (AMS), Providence, RI 
Year  2009 
Edition  0 
Translation 
No 
Refereed 
No 