Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials (Q2456589): Difference between revisions
From MaRDI portal
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
complexity
0 references
Poincaré-Birkhoff-Witt algebras
0 references
Bernstein-Sato ideals
0 references
running times
0 references
0 references
0 references