On the complexity of computing critical points with Gröbner bases (Q2934482)
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 critical points with Gröbner bases |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of computing critical points with Gröbner bases |
scientific article |
Statements
On the Complexity of Computing Critical Points with Gröbner Bases (English)
0 references
12 December 2014
0 references
critical points
0 references
polynomial minimization
0 references
complexity
0 references
Groebner basis
0 references
structured polynomial system
0 references
0.8852487802505493
0 references
0.8023858666419983
0 references
0.7908700108528137
0 references
0.7814187407493591
0 references
0.7813930511474609
0 references
