✦ LIBER ✦

Constructing optimal binary decision trees is NP-complete

✍ Scribed by Laurent Hyafil; Ronald L. Rivest

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating Optimal Binary Decision Tr

✍ Micah Adler; Brent Heeringa 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 389 KB

NP-Complete decision problems for binary

✍ Kenneth L. Manders; Leonard Adleman 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 895 KB

Optimal Jacobian accumulation is NP-comp

✍ Uwe Naumann 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 204 KB

Computing the nearest neighbor interchan

✍ Mirko Křivánek 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 282 KB

Microcode Bit Optimization is NP-Complet

✍ Robertson, E.L. 📂 Article 📅 1979 🏛 IEEE 🌐 English ⚖ 906 KB

Optimal three-dimensional layouts of com

✍ Ajay K. Gupta; Susanne E. Hambrusch 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 731 KB