时间复杂性

该算法的时间复杂性为O（n）。

Time complexity of this algorithm is O ( n ) .

一个算法较为简单，其时间复杂性为O（n）。

One is simple , its time complexity is O ( n ) .

求解SAT问题的局部搜索算法及其平均时间复杂性分析

Local search for Solving SAT Problems and its average time complexity

它的时间复杂性是O（n~2），空间复杂性是O（n）。

Its time complexity is O ( n2 ) and space complexity is O ( n ) .

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

This paper introduces a map sort algorithm with extra memory cost , its time complexity is O ( N ) .

而对边添加和边权减少的情况，本文给出时间复杂性为O（n￣2）的修改算法。

For the case that new edges are added to G or edge weights decrease , an O ( n2 ) incremental algorithm is given .

最后证明了运算法的时间复杂性为O（N~2），其中N为原多边形的边数。

The time complexity of the algorithm is proved to be O ( n2 ) , where N is the number of edges of the original polygon .

若用快速富里叶变换（FFT）计算，这些算法的时间复杂性均为O（n1n2log2n1n2）。

If we use FFT , their computation time complexity are all O ( n_1n_2 log_2 n_1n_2 ) .

本文提出了一种基于RSA的公开钥密码体制，其加、脱密算法具有与RSA相同量级的时间复杂性，并克服了RSA体制及现已提出的各种RSA修改体制中的一些缺点。

A public key cryptosystem based on RSA is presented to overcome some short-cominis of RSA .

然而，理论分析证明，自动测试生成的时间复杂性是个NP完全问题。随着电路规模的增大，测试生成越来越困难。

But theoretical analyze proofs that time complexity for automatic test generation is an NP-completeness problem .

Valiant并行归并及排序时间复杂性的分析研究

Fur the r Analysis and Research about Valiant Merging and Sorting

对这些算法的I/O时间复杂性和CPU时间复杂性进行了细致分析，并对这3种算法和其他Cube算法进行了大量的实验研究，对性能进行了分析比较。

The detail analysis of I / O and CPU cost are also given , and compared with the existed algorithms by experiment .

从理论分析和数据实验两方面都表明，此算法的时间复杂性和精度都与LU分解法相当。

It can be seen that both the time complexity and precision are matched with those of LU resolving method through theory analysis and data experiment .

现有分组调度算法难以同时满足时间复杂性低和QoS保障能力强两方面的要求，本文提出了一种基于均匀服务序列的分组调度算法，并给出其NP实现。

Existing packet scheduling algorithms can not fulfill the two goals at the same time , i.e. , low time complexity and good QoS guarantee .

RNA二级结构图的书嵌入自1999年提出以来由于其高时间复杂性（NP完全）而一直停留在概念上。

Book embedding of arc graph is just a concept since it was proposed in 1999 because of its high time complexity ( NP-complete ) .

证明了该Hash函数的存在和单调性，算法在装载因子为1／2的条件下具有O（N）的时间复杂性。

We have proved the existence of Hash function , its monotonicity and the time complexity O ( N ) under the condition of 1 / 2 load factor .

文章给出一种新的RSA的快速算法，结合模n和底数a对指数m动态地取最优的幂后进行模幂乘运算，时间复杂性分析表明新算法可以减少加密和解密的计算量。

It is shown by time complexity that the new algorithm obtains the speed improvement of encryption and decryption compared with the modular exponentiation by the repeated squaring method .

后者的计算时间复杂性远远低于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 ) .

其特点是在内排序中关键字与数组下标作映射或链接处理，不实施反复比较与交换关键字的操作，时间复杂性达到O（N）；在外排序中，文件输入/输出次数减少，提高了效率。

No comparsion and exchange of keywords is done , with time complexity being O ( N ): In external sort , there are only two file I / O records and the efficiency is enhanced .

在此基础上，提出了基于粗糙熵的知识约简算法，该算法的时间复杂性为O（｜R｜3｜U｜2）。

Accordingly , the paper offers algorithm for reduction of knowledge based on rough entropy , of which time complexity is O ( | R | 3 | U | 2 ) .

设计了环形滑动窗口和挖掘异步偶合模式的抗噪声增量算法，其时间复杂性小于O（n2）；

The anti-noise increment algorithms are designed on loop sliding windows to mine asynchronous coincidence pattern and implemented with complexity O ( n2 );

此算法具有比BF算法更优越的时间复杂性，并且相对KMP算法而言更简洁易懂。

This new algorithm has some advantage of less time complexity than BF algorithm and more simple than KMP algorithm .

在CBIR中，维度灾难以及相似性度量函数的时间复杂性一直困扰着研究人员。

In CBIR , the " dimension disaster " and the high time complexity of similarity measure function has been plagued researchers .

本文在给出已有的自适应的WBS压缩方法的基础上，讨论了提高它的时间复杂性和改进压缩比的若干理论问题。

Based on existent adaptive WBS approach , two schemes about updating its time complexity and compression ratio are discussed in this paper .

该算法还有良好的时间复杂性O（N3）和空间复杂性O（N），可用于任意大小图像的压缩与传输。

The algorithm has acceptable time complexity O ( N3 ) and space complexity O ( N ), and it could be used to compress and transmit any size of images .

本文介绍了一种UET系统中有效的调度算法，其时间复杂性函数为O（na（n）+e）。

This paper introduces an effective scheduling algorithm in UET ( Unit Execution Time ) system , its time complexity function being O ( na ( n ) + e ) .

和Dijkstra算法相比，算法大大减小搜索空间，提高搜索速度，时间复杂性不超过O（N），N为网络节点数。

Compared with Dijkstra algorithm , the algorithm can reduce seeking space and can raise seeking speed greatly , and its time complexity can not exceed O ( N ), while N is the number of road net points .

本文提出了一种优先试探集软判译码算法，该算法不仅时间复杂性比经典的Chase算法有显著降低，而且译码性能也有所提高。

In this paper , a class ol Prior Tries Set ( PT ) soft decision decoding algorithms which have far less time complexity and better decoding performance than classical chase algorithms is presented .

本文提出一个基于信息量的属性约简的启发式算法，该算法的时间复杂性为O（A3U2）。

In this paper , an information quantity-based heuristic algorithm for reduction of attribute is proposed , the time complexity of this algorithm is $ O ( | A | + 3 | U | + 2 ) $ .

前者的时间复杂性为O（n），而后者的时间复杂性分别是O（n2）及低于O（2nn2）。

The time complexity of the former is O ( n ), but the time complexities of the latter two are O ( n ~ 2 ) and lower than O ( 2 ~ nn ~ 2 ) respectively .