青年中文time complexity的意思
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.