On the Complexity of Numerical Analysis (Q3642872): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56067400, #quickstatements; #temporary_batch_1704806754709 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:01, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Numerical Analysis |
scientific article |
Statements
On the Complexity of Numerical Analysis (English)
0 references
6 November 2009
0 references
Blum-Shub-Smale model
0 references
arithmetic circuits
0 references
counting hierarchy
0 references
BPP
0 references
sum of square roots problem
0 references
straight-line programs
0 references
