Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity lower bounds for computation trees with elementary transcendental function gates |
scientific article; zbMATH DE number 1058976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity lower bounds for computation trees with elementary transcendental function gates |
scientific article; zbMATH DE number 1058976 |
Statements
Complexity lower bounds for computation trees with elementary transcendental function gates (English)
0 references
9 September 1997
0 references
computation trees
0 references
0 references
0 references
0 references
0.7961621284484863
0 references
0.7691444754600525
0 references
0.7626771330833435
0 references
0.757034420967102
0 references
