Paper ID: 2304.02781

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.

Submitted: Apr 5, 2023