Inapproximability of sufficient reasons for decision trees

04/05/2023

∙

by   Alexander Kozachinskiy, et al.

∙

0

∙

share

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