Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876): Difference between revisions
From MaRDI portal
Latest revision as of 01: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