On the complexity of computing Gröbner bases for quasi-homogeneous systems (Q2963233)
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: On the complexity of computing Gröbner bases for quasi-homogeneous systems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing Gröbner bases for quasi-homogeneous systems |
scientific article |
Statements
On the complexity of computing gröbner bases for quasi-homogeneous systems (English)
0 references
10 February 2017
0 references
Gröbner bases
0 references
polynomial system solving
0 references
quasi-homogeneous polynomials
0 references
0.8894286155700684
0 references
0.7722504734992981
0 references
0.7596501708030701
0 references
0.751716136932373
0 references
0.7474284768104553
0 references
