The average number of registers needed to evaluate a binary tree optimally (Q1253100)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3614191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The average number of registers needed to evaluate a binary tree optimally |
scientific article; zbMATH DE number 3614191 |
Statements
The average number of registers needed to evaluate a binary tree optimally (English)
0 references
1979
0 references
Binary Tree
0 references
Registers
0 references
Asymptotic Expansion
0 references
Enumeration
0 references
