Constructing optimal binary decision trees is NP-complete
Laurent Hyafil, Ronald L. Rivest · Information Processing Letters · 1976
Cited by 956 works. doi:10.1016/0020-0190(76)90095-8
Authors
References
- The Design and Analysis of Computer Algorithms
- Reducibility among Combinatorial Problems
- The complexity of theorem-proving procedures
- Conversion of limited-entry decision tables to computer programs
- Optimal Binary Identification Procedures
- Algorithm 268: ALGOL 60 reference language editor [R2]
- Combining decision rules in a decision table