Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial.
在此基础上提出了优化的知识约简算法，该算法的时间复杂度是多项式的。
2
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.