For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial.
在此基础上提出了优化的知识约简算法，该算法的时间复杂度是多项式的。
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.
给出了二维数组的体差不等式测试算法，并证明二维数组的体差不等式测试算法具有多项式时间复杂度。
The method with computation complexity of polynomial order, has been successfully applied to the real-time analysis of signals in mobile ECG telemonitoring systems.
该算法具有多项式级的计算复杂度，已成功应用于移动式远程心电监护系统ECG信号的实时分析。
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.
再次，对有序决策表进行了研究，提出了一种基于优势矩阵的启发式属性约简算法。
Note: Your solution should be in polynomial time complexity.
注意：你的解法应该满足多项式时间复杂度。
The complexity of DSAFO is bounded between quadratic and cubic polynomial time.
DSAFO算法具有不错的时间复杂度：介于平方和三次方之间。
The complexity of DSAFO is bounded between quadratic and cubic polynomial time.
DSAFO算法具有不错的时间复杂度：介于平方和三次方之间。
应用推荐