Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial.

在此基础上提出了优化的知识约简算法，该算法的时间复杂度是多项式的。

youdao

This paper presents a new dependence difference inequality test algorithm for two-dimensional arrays, and proves that the time complexity of the algorithm is polynomial.

给出了二维数组的体差不等式测试算法，并证明二维数组的体差不等式测试算法具有多项式时间复杂度。

youdao

After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial.

再次，对有序决策表进行了研究，提出了一种基于优势矩阵的启发式属性约简算法。

youdao

After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial.

再次，对有序决策表进行了研究，提出了一种基于优势矩阵的启发式属性约简算法。

youdao