time complexity信息详情
[计]时间复杂度
complexity───n.复杂，复杂性；复杂错综的事物
complexity synonym───复杂性同义词
complexity roster───复杂性名册
phrasal complexity───短语复杂性
complexity meaning───复杂性意义
complexity means───复杂性意味着
complexity gaming───复杂性博弈
complexity crossword───复杂性纵横字谜
complexity crossword clue───复杂度纵横字谜线索
IsValidCommandLineOption has a lookup time complexity of o (1).───的查找时间复杂度为o (1)。
Finally, the analysis of time complexity is presented and a contrast.───最后进行了算法复杂度的理论分析和比较。
time complexity of computation procedure is analysed.───分析了计算过程的时间复杂性。
General, if we do not consider the length of pattern, a time complexity O (n) algorithm should be optimal, but the fact is not the case.───一般，如果不考虑模式串的长度，一个具有时间复杂度O（n）的算法应该是最优的了，但是事实不是如此。
Experiments show that this new algorithm can improve time complexity and obtain solutions of excellent quality.───实验仿真结果表明此算法改善了求解的时间复杂度，可以获得问题高质量的解。
On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.───在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。
It also showed that the time complexity can be decreased a bit more with little considering the space limit.───同时，在空间允许的条件下，展示了如何修改此方法将时间复杂度大大降低的可能性。
In many practical problems it is proved that the coefficient of time complexity can be improved by balancing the size of the subproblem.───在很多具体问题上可证明子问题平衡对时问复杂性的常系数可以有改进。
The time complexity of online recommendation was the key indicator to measure recommend algorithm in real recommendation system.───在实际的推荐系统中，在线推荐的时间复杂度是衡量推荐算法的主要指标。
Time complexity and space complexity in searching binary complementary sequence pair are very huge because four sequences are involved in the calculation.
The computing complexity theory discusses the time complexity and the space complexity of the algorithms.
The time complexity of computation procedure is analysed.
Methods of time complexity analysis are usually based on abstractive algorithms, rather than actual programs.
The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
Experimental results show that the time complexity of this algorithm is much better than that of other construction algorithm of concept lattice from whole fonnal context.
Further its consistency time complexity and space complexity will be discussed.
Many operations have logarithmic time complexity.
The problem for time complexity of evolutionary algorithms ( EAs ) is rarely solved well before.