On Polynomial time Constructions of Minimum Height Decision Tree

no code implementations • 1 Feb 2018 • Nader H. Bshouty, Waseem Makhoul

The second result is a polynomial time $(\ln 2) DEN(A)$-approximation (and therefore $(\ln 2) ETD(A)$-approximation) algorithm for the depth of the decision tree of $A$.