On the Complexity of Computing Critical Points with Gröbner Bases (Q2934482): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066979034 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1309.2138 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:03, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
