Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
From MaRDI portal
Publication:2456589
DOI10.1016/j.jsc.2005.05.004zbMath1120.68404MaRDI QIDQ2456589
Jesús Gago-Vargas, José María Ucha Enríquez, María Isabel Hartillo Hermoso
Publication date: 19 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/23600
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
16S36: Ordinary and skew polynomial rings and semigroup rings
32C38: Sheaves of differential operators and their modules, (D)-modules
16S32: Rings of differential operators (associative algebraic aspects)
16Z05: Computational aspects of associative rings (general theory)
Related Items
Constructive \(D\)-module theory with \texttt{Singular}, Local Bernstein-Sato ideals: algorithm and examples
Uses Software
Cites Work
- An algorithm for de Rham cohomology groups of the complement of an affine variety via \(D\)-module computation
- An algorithm of computing \(b\)-functions
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The analytic continuation of generalized functions with respect to a parameter
- On the computation of Bernstein-Sato ideals.
- Constructions in Algebra
- Module Structure of Weyl Algebras
- Démonstration constructive de l'existence de polynômes de Bernstein–Sato pour plusieurs fonctions analytiques
- Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item