Inapproximability of sufficient reasons for decision trees
arXiv:2304.02781
Abstract
In this note, we establish the hardness of approximation of the problem of computing the minimal size of a -sufficient reason for decision trees.
11 pages
arXiv:2304.02781
In this note, we establish the hardness of approximation of the problem of computing the minimal size of a -sufficient reason for decision trees.
11 pages