A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10208-016-9319-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10208-016-9319-7 / rank | |||
Normal rank | |||
Latest revision as of 03:16, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time |
scientific article |
Statements
A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (English)
0 references
1 December 2017
0 references
polynomial system
0 references
homotopy continuation
0 references
complexity analysis
0 references
0 references
0 references
