Pages that link to "Item:Q5249043"
From MaRDI portal
The following pages link to FINDING SMALL EQUIVALENT DECISION TREES IS HARD (Q5249043):
Displaying 4 items.
- On the hardness of the minimum height decision tree problem (Q1885823) (← links)
- Minimization of decision trees is hard to approximate (Q2475411) (← links)
- Decision tree approximations of Boolean functions (Q5958322) (← links)
- Properly learning decision trees in almost polynomial time (Q6551255) (← links)