On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 12:53, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials |
scientific article |
Statements
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (English)
0 references
1989
0 references
worst-case arithmetic complexity
0 references
zeros of systems of polynomials
0 references
upper and lower bounds
0 references
algorithm
0 references
