zbMATH — the first resource for mathematics

Constructing optimal binary decision trees is NP-complete. (English) Zbl 0333.68029

68W99 Algorithms in computer science
68Q25 Analysis of algorithms and problem complexity
68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
Full Text: DOI
[1] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., The design and analysis of computer algorithms, (1974), Addison-Wesley · Zbl 0207.01701
[2] Cook, S., The complexity of theorem-proving procedures, 3rd ann. ACM symp. on theory of computing, 151-158, (1970)
[3] Garey, M., Optimum binary identification procedures, SIAM J. appl. math., 23, 173-186, (1972) · Zbl 0229.68037
[4] Karp, R.M., Reducibility among combinatorial problems, IBM symp. on computational complexity, 85-103, (1973)
[5] Pollack, S.L., Conversion of limited-entry decision tables to computer programs, Cacm, 8, 667-672, (1965) · Zbl 0129.10210
[6] Shwayder, Keith, Combining decision rules in a decision table, Cacm, 18, 476-480, (1975) · Zbl 0307.94034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.