The computational time complexity is an important topic in the theory of evolutionary algorithms.

计算时间复杂性是演化理论中的一个重大课题。

youdao

Then, an iterative reasoning algorithm of TDCD is put forward, and its computational time complexity is analyzed.

在此基础提出了一种带时间延迟的因果图迭代推理算法，并分析了算法的时间复杂度。

youdao

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

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

youdao