论文信息 - Constructing Optimal Binary Decision Trees is NP-Complete - 字舞流文

Constructing Optimal Binary Decision Trees is NP-Complete

Ronald L. Rivest | Laurent Hyafil | R. Rivest | L. Hyafil

[1] Keith Shwayder. Combining decision rules in a decision table , 1975, CACM.

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] M. Garey. Optimal Binary Identification Procedures , 1972 .

[4] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[5] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[6] W. M. McKeeman,et al. Algorithm 268: ALGOL 60 reference language editor [R2] , 1965, CACM.

[7] Solomon L. Pollack,et al. Conversion of limited-entry decision tables to computer programs , 1965, CACM.