全部

1·The time complexity of computation procedure is analysed.

分析了计算过程的时间复杂性。

2·IsValidCommandLineOption has a lookup time complexity of o (1).

IsValidCommandLineOption的查找时间复杂度为o (1)。

3·Finally, the analysis of time complexity is presented and a contrast.

最后进行了算法复杂度的理论分析和比较。

4·Finally, the time complexity in the best and the worst case was analyzed.

最后分析了该方法在最好和最坏情况下的时间复杂度。

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

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

6·It also shows its security and certifies its communication complexity and time complexity.

讨论了其安全性并证明了该机制的通信复杂度与时间复杂度。

7·We analyze the time complexity of algorithm and compare it with Rough sets based algorithm.

文章分析了算法的时间复杂度，并同粗糙集算法进行了对比。

8·What is meant by Constant Amortized time when talking about time complexity of an algorithm?

讨论算法的时间复杂度时，“恒定分摊时间”是个什么鬼？

9·This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).

本文介绍了映射式排序算法，这种算法附加一定的存储开销，时间复杂性为O (N)。

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

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