A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739)
From MaRDI portal
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
