Resumen de Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
Jesús Gago Vargas, José María Ucha Enríquez, María Isabel Hartillo Hermoso
Let f1,¿,fp be polynomials in and let D=Dn be the n-th Weyl 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.
