Details:
Title  Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials  Author(s)  Jesús GagoVargas, M.I. HartilloHermoso, Jose Maria UchaEnriquez  Type  Article in Journal  Abstract  Let f_1 , … , f_p be polynomials in C [ x_1 , … , x_n ] and let D = D_n be the n th Weyl algebra. We provide upper bounds for the complexity of computing the annihilating ideal of f^s = f_1^s_1 ⋯ f_p^s_p in D [s] = D [ s_1 , … , s_p ] . These bounds provide an initial explanation of the differences between the running times of the two methods known to obtain the socalled Bernstein–Sato ideals.  Keywords  Complexity, Poincaré–Birkhoff–Witt algebras, Bernstein–Sato ideals  ISSN  07477171 
URL 
http://www.sciencedirect.com/science/article/pii/S0747717105000763 
Language  English  Journal  Journal of Symbolic Computation  Volume  40  Number  3  Pages  1076  1086  Year  2005  Edition  0  Translation 
No  Refereed 
No 
