A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time (Q1683739): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1507.05485 / rank | |||
Normal rank | |||
Revision as of 20:43, 18 April 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
