Alphabetic minimax trees in linear time (Q4928471)
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 6176240
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alphabetic minimax trees in linear time |
scientific article; zbMATH DE number 6176240 |
Statements
Alphabetic Minimax Trees in Linear Time (English)
0 references
14 June 2013
0 references
minimax tree
0 references
Yeung's inequality
0 references
linear decision tree
0 references
0.8929095268249512
0 references
0.8911046981811523
0 references
0.8773618936538696
0 references
0.873542308807373
0 references
