For both problems, we study their computational complexity and present optimal algorithms or polynomialtime approximation algorithms.
并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。
2
Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which timecomplexity was polynomial.
在此基础上提出了优化的知识约简算法,该算法的时间复杂度是多项式的。
3
This paper presents a new dependence difference inequality test algorithm for two-dimensional arrays, and proves that the timecomplexity of the algorithm is polynomial.