Complexity lower bounds for approximation algebraic computation trees (Q1578509): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:55, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity lower bounds for approximation algebraic computation trees |
scientific article |
Statements
Complexity lower bounds for approximation algebraic computation trees (English)
0 references
3 September 2000
0 references
approximate computations
0 references
