Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials (Q2456589): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithm for computing Bernstein-Sato ideals associated with a polynomial mapping. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Démonstration constructive de l'existence de polynômes de Bernstein–Sato pour plusieurs fonctions analytiques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analytic continuation of generalized functions with respect to a parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of Bernstein-Sato ideals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the word problems for commutative semigroups and polynomial ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm of computing \(b\)-functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for de Rham cohomology groups of the complement of an affine variety via \(D\)-module computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3759138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions in Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Module Structure of Weyl Algebras / rank
 
Normal rank

Latest revision as of 11:20, 27 June 2024

scientific article
Language Label Description Also known as
English
Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials
scientific article

    Statements

    Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials (English)
    0 references
    19 October 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity
    0 references
    Poincaré-Birkhoff-Witt algebras
    0 references
    Bernstein-Sato ideals
    0 references
    running times
    0 references
    0 references
    0 references
    0 references