Constructing optimal binary decision trees is NP-complete

Information Processing Letters

Volumn 5, Issue 1, 1976, Pages 15-17

  Hyafil, Laurent ^a   Rivest, Ronald L ^b  

^a IRIA   (France)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Binary decision trees; computational complexity; NP complete

Indexed keywords

EID: 0001815269     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(76)90095-8     Document Type: Article

References (6)

1. The Complexity of Theorem-Proving Procedures
2. Optimum Binary Identification Procedures
3. Reducibility among Combinatorial Problems
4. Conversion of Limited-Entry Decision Tables to Computer Programs
5. Combining Decision Rules in a Decision Table