Inapproximability of sufficient reasons for decision trees
In this note, we establish the hardness of approximation of the problem of computing the minimal size of a δ-sufficient reason for decision trees.
READ FULL TEXTIn this note, we establish the hardness of approximation of the problem of computing the minimal size of a δ-sufficient reason for decision trees.
READ FULL TEXT