✦ LIBER ✦
Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems
✍ Scribed by Jianer Chen; Iyad A. Kanj; Ge Xia
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Weight
- 270 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.