Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
-
Autores: Jesús Gago Vargas
, José María Ucha Enríquez , María Isabel Hartillo Hermoso
- Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 40, Nº 3, 2005, págs. 1076-1086
- Idioma: inglés
- DOI: 10.1016/j.jsc.2005.05.004
- Enlaces
-
Resumen
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.
¿Es nuevo? Regístrese
Ventajas de registrarse
