Inapproximability of sufficient reasons for decision trees

Alexander Kozachinskiy

In this note, we establish the hardness of approximation of the problem of computing the minimal size of a $\delta$-sufficient reason for decision trees.