Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (Q2280315)
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: Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals |
scientific article; zbMATH DE number 7144441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals |
scientific article; zbMATH DE number 7144441 |
Statements
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals (English)
0 references
18 December 2019
0 references
polynomial reduction
0 references
Gröbner basis
0 references
complexity
0 references
algorithm
0 references
0 references
0 references
0.9983933568000792
0 references
0.903807520866394
0 references
0.8014504909515381
0 references
0.7990726232528687
0 references
0.7867556810379028
0 references
