This was due to the scheduler being implemented using an algorithm with o (n) complexity.
这是由于调度器是使用一个复杂度为O (n)的算法实现的。
For example, if the complexity order of the current technique is O(n**2), speeding up the steps by 10x is a lot less helpful than finding an O(n) substitute.
例如，如果当前技术的复杂性等级是O(n**2)，那么将这些步骤加速10倍远不及寻找 O(n) 替代品来得有用。
UDDI Version 1 only supported a file-based replication scheme whose complexity grew as n-squared with the number of registry node implementations participating within a UDDI registry.
UDDI版本1仅支持基于文件的复制模式，随参与到uddi注册中心中的注册中心节点实现数目的增长，其复杂程度以n的平方增长。
Results show that N-L system owns the dynamical complexity of chaotic system.
研究结果表明，N - L系统具有复杂的混沌动力学特性。
The preconditioner is generated from the target's "geometry structure " and not from the "matrix element", which assured the computational complexity for generating the preconditioner is only O(N) .
在构造预条件因子时，采用从目标的“几何结构剖分”出发，而不是从“矩阵元素”出发确定“基权函数之间的作用量关系”，这样保证了构造预条件矩阵的计算复杂度仅为O（N）。
The paper analyzes the complexity of trust negotiation protocol, and its communication cost is linear, computing cost is o (n · K).
还分析了信任协商协议的复杂性，其通信开销为线性，计算开销为O (n·k)。
This paper introduces a map sort algorithm with extra memory cost, its time complexity is o (n).
本文介绍了映射式排序算法，这种算法附加一定的存储开销，时间复杂性为O (N)。
Its time complexity is o (n), and its appended storage space is very small. The algorithm particularly suits to the situation of large amounts of data.
该算法的时间复杂度为O (N)，且附加存储空间极小，特别适合于数据量大的场合。
The computational complexity of the improved algorithm approaches polynomial complexity, much less than 2 N ( N is the vertex number of a graph).
后者的计算时间复杂性远远低于2N（N为图的顶点数） ，已接近于多项式时间复杂性。
The accelerator is implemented with multiple levels of bit manipulator instead of MUX, it reduces the time complexity of the accelerator from o (n) to o .
该方法通过使用分层位操作电路取代分层MUX选择电路实现位操作加速来减少电路时延，使得位操作加速器的时间复杂度从o (N)降到了O 。
The encoding complexity of LDPC codes length n seems indeed to be of order n2, the dissertation study the coding scheme with linear time complexity.
针对LDPC码通用编码算法的复杂度与码长的平方成正比的问题，重点研究了LDPC码的快速编码方法，总结出了使LDPC码能够达到线性编码的途径。
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)的算法应该是最优的了，但是事实不是如此。
Use merge sort, in a binary search algorithm complexity: nlogn, n number two together, if can equal to a specific number m, the output yes, otherwise no output.
说明：运用归并排序，在用二分法查找，算法复杂度：nlogn，n个数两两相加，若能等于特定数m，则输出yes，否则输出no。
Code volume quite low, but when the need for greater data a longer period of time complexity is o n!
代码量挺少，不过数据较大的时候需要时间比较长，时间复杂度为O n ！
Normally, this algorithm's time complexity is o (n), so it can't satisfy real-time well.
通常情况下，该算法的时间复杂度为O (n)，而这样的时间复杂度不能很好地满足实时系统的要求。
By analysis, Communication Complexity of the DTCA is o (n).
通过分析可知，DT CA算法的通信复杂度为O (N)。
There are two sorted arrays A and B of size mand n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
这个题是求两个有序数组的中间数，其实这个中间数，如果是奇数，就是中间的那个数，如果是偶数，就是中间的两个数的和的平均值。
There are two sorted arrays A and B of size mand n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
这个题是求两个有序数组的中间数，其实这个中间数，如果是奇数，就是中间的那个数，如果是偶数，就是中间的两个数的和的平均值。
应用推荐