Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q30048515, #quickstatements; #temporary_batch_1706897434465 |
Removed claims |
||
| Property / author | |||
| Property / author: Q198260 / rank | |||
| Property / author | |||
| Property / author: Nikolaj N. jun. Vorob'ev / rank | |||
Revision as of 14:04, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity lower bounds for computation trees with elementary transcendental function gates |
scientific article |
Statements
Complexity lower bounds for computation trees with elementary transcendental function gates (English)
0 references
9 September 1997
0 references
computation trees
0 references
