On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials (Q3831940): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:12, 5 February 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
