On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae (Q4027865): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:31, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae |
scientific article |
Statements
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae (English)
0 references
9 March 1993
0 references
decision methods
0 references
roots
0 references
computational complexity
0 references
systems of polynomial equations
0 references
inequalities
0 references
