Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials (Q2456589): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: SINGULAR / rank | |||
Normal rank |
Revision as of 20:29, 29 February 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
complexity
0 references
Poincaré-Birkhoff-Witt algebras
0 references
Bernstein-Sato ideals
0 references
running times
0 references