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

From MaRDI portal
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 09:16, 5 March 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