Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Revision as of 03:06, 5 March 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
