Complexity lower bounds for approximation algebraic computation trees (Q1578509): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57733282, #quickstatements; #temporary_batch_1706897434465 |
Removed claim: author (P16): Item:Q1253697 |
||
| Property / author | |||
| Property / author: Q198260 / rank | |||
Revision as of 18:37, 22 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
