Minimization of decision trees is hard to approximate (Q2475411): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2007.06.014
+Normal rank
@@ Property / OpenAlex ID @@
+W2026324637
@@ Property / OpenAlex ID: W2026324637 / rank @@
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity measures and decision tree complexity: a survey.
+Normal rank
@@ Property / cites work @@
+Learning decision trees from random examples
@@ Property / cites work: Learning decision trees from random examples / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the optimal variable ordering for binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact learning when irrelevant variables abound
@@ Property / cites work: Exact learning when irrelevant variables abound / rank @@
+Normal rank
@@ Property / cites work @@
+Q4888830
@@ Property / cites work: Q4888830 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on learning decision lists and trees
@@ Property / cites work: Lower bounds on learning decision lists and trees / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing optimal binary decision trees is NP-complete
+Normal rank
@@ Property / cites work @@
+On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+The nonapproximability of OBDD minimization
@@ Property / cites work: The nonapproximability of OBDD minimization / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of minimizing and learning OBDDs and FBDDs
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+FINDING SMALL EQUIVALENT DECISION TREES IS HARD
@@ Property / cites work: FINDING SMALL EQUIVALENT DECISION TREES IS HARD / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2475411