✦ LIBER ✦
Set Orderings Requiring Costliest Alphabetic Binary Trees
✍ Scribed by Kleitman, D. J.; Saks, Michael E.
- Book ID
- 118212985
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1981
- Weight
- 633 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0196-5212
- DOI
- 10.1137/0602018
No coin nor oath required. For personal study only.