Before revision:  To this end, we first show that, given a pre-defined policy, the problem of finding the optimal set of counterfactual explanations is NP-hard.
After revision:  We first show that, given a pre-defined policy, the problem of finding the optimal set of counterfactual explanations is NP-hard.