着重证明了K -树组法为多项式时间复杂性算法。

It is proved that K-Tree Term method is a multinomial time complexity algorithm.

youdao

后者的计算时间复杂性远远低于2N（N为图的顶点数） ，已接近于多项式时间复杂性。

The computational complexity of the improved algorithm approaches polynomial complexity, much less than 2 N ( N is the vertex number of a graph).

youdao

并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。

For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.

youdao

并且对这两类问题都研究了他们的计算复杂性并给出了最优算法或者多项式时间近似算法。

For both problems, we study their computational complexity and present optimal algorithms or polynomial time approximation algorithms.

youdao