On the hardness of the minimum height decision tree problem (Q1885823): Difference between revisions

@@ Property / cites work @@
+Decision Trees for Geometric Models
@@ Property / cites work: Decision Trees for Geometric Models / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527016
@@ Property / cites work: Q4527016 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Optimal Binary Identification Procedures
@@ Property / cites work: Optimal Binary Identification Procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing optimal binary decision trees is NP-complete
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank