To consistent decision tables, the minimal reduct has been proved to be NP-hard.

最优属性约简是NP困难问题，目前出现的启发式算法多是以决策表的核为起点。

youdao

To consistent decision tables, the minimal reduct has been proved to be NP-hard.

最优属性约简是NP困难问题，目前出现的启发式算法多是以决策表的核为起点。

youdao