Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials (Q2456589)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
scientific article; zbMATH DE number 5202058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials |
scientific article; zbMATH DE number 5202058 |
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
0.8963965773582458
0 references
0.7809035181999207
0 references
0.7705119848251343
0 references
0.7437623143196106
0 references
0.73832768201828
0 references
