Pages that link to "Item:Q1885823"
From MaRDI portal
The following pages link to On the hardness of the minimum height decision tree problem (Q1885823):
Displaying 12 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- Approximating decision trees with value dependent testing costs (Q2345858) (← links)
- Approximating optimal binary decision trees (Q2428690) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- On Polynomial Time Constructions of Minimum Height Decision Tree (Q5091026) (← links)
- Theoretical Analysis of Git Bisect (Q6492083) (← links)
