Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/tcs/GrigorievV96, #quickstatements; #temporary_batch_1731543907597 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/tcs/GrigorievV96 / rank | |||
Normal rank | |||
Latest revision as of 02:34, 14 November 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
0 references
0 references
0 references
