Alphabetic Minimax Trees (Q3680759)
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 3902559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alphabetic Minimax Trees |
scientific article; zbMATH DE number 3902559 |
Statements
Alphabetic Minimax Trees (English)
0 references
1985
0 references
optimal weighted tree
0 references
alphabetic tree
0 references
upper bound
0 references
fanout reduction
0 references
rooted tree
0 references
t-ary tree
0 references
linear algorithm
0 references
minimax value
0 references
fan-out constraints
0 references
logical circuits
0 references
0.8773618936538696
0 references
0.8761711716651917
0 references
0.8582741022109985
0 references
0.8562036752700806
0 references
