Title of article
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
Author/Authors
J. Gago-Vargas، نويسنده , , M.I. Hartillo-Hermoso، نويسنده , , J.M. Ucha-Enr?quez، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
11
From page
1076
To page
1086
Abstract
Let f1,…,fp be polynomials in and let D=Dn be the n-thWeyl algebra. We provide upper bounds for the complexity of computing the annihilating ideal of in D[s]=D[s1,…,sp]. These bounds provide an initial explanation of the differences between the running times of the two methods known to obtain the so-called Bernstein–Sato ideals.
Keywords
Complexity , Poincaré–Birkhoff–Witt algebras , Bernstein–Sato ideals
Journal title
Journal of Symbolic Computation
Serial Year
2005
Journal title
Journal of Symbolic Computation
Record number
805873
Link To Document