时间复杂度和空间复杂度过大的问题。
什么是时间复杂度和空间复杂度的字典？
给出一个算法计算n ！，分析它的时间复杂度。
Give an algorithm to compute n! And analyze its running time.
最后分析了该方法在最好和最坏情况下的时间复杂度。
Finally, the time complexity in the best and the worst case was analyzed.
讨论算法的时间复杂度时，“恒定分摊时间”是个什么鬼？
What is meant by "Constant Amortized time" when talking about time complexity of an algorithm?
这些样本点的求得能有效减少求解最小聚类的时间复杂度。
By working out such sample data the time complexity of figuring out min cluster is effectively reduced.
文章分析了算法的时间复杂度，并同粗糙集算法进行了对比。
We analyze the time complexity of algorithm and compare it with Rough sets based algorithm.
通过递归实例，介绍了递归算法时间复杂度的一类分析方法。
Using real example of recursion, we introduce a type of analysis method of recursion algorism's time complexity.
讨论了其安全性并证明了该机制的通信复杂度与时间复杂度。
It also shows its security and certifies its communication complexity and time complexity.
并提出改进的值约简算法，时间复杂度在原有基础上大大减少。
And putting forwarded the improved algorithm of value attribute reduction that decreases the complexity of time greatly.
我需要得到此算法的时间复杂度，那就明确地给出其，运行时间。
I ask you for the running time of this algorithm and you give me the running time in terms of the running time, right.
以联动轴数作为输入考察插补速度，算法时间复杂度是对数阶的。
The algorithm running time is a logarithmic function of the number of linkage axes.
实验结果表明，该算法有效地降低了时间复杂度，具有一定的实用性。
The experimental result shows that the algorithm can reduce time complexity effectively and has definite practicability.
之后，作者考虑时间复杂度和报文复杂度，得出递归算法的两点改进。
Then, it considers the time complexity and the message complexity, and makes some improvement on the broadcasting algorithm.
一直以来，最优解的排课算法的时间复杂度大多是排课规模的指数阶。
The complexity of optimum-solution schedule arrangement algorithm has almost been exponent degree of schedule scale.
实验结果表明，改进后的算法降低了时间复杂度，提高了系统检测效率。
The improved algorithm can reduce time complexity and increase the checking efficiency of the system by experiment.
编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
传统的利用区分矩阵进行属性约简算法，其时间复杂度和空间复杂度很大。
The time complexity and space complexity of the traditional attribute reduction algorithm using discernible matrix are quite big.
提出了一种新的动态路由和波长分配算法，对算法的时间复杂度进行了分析。
A new dynamic routing and wavelength assignment algorithm is proposed and the time complexity of the algorithm is analyzed.
在该算法中，还使用了一定的剪枝策略，使得算法的时间复杂度进一步降低。
Besides, in this algorithm, we have used some strategy of pruning, which make the algorithm's time complexity more lower.
IsValidCommandLineOption的查找时间复杂度为o (1)。
IsValidCommandLineOption has a lookup time complexity of o (1).
它将从预定的有效命令行选项列表和时间复杂度为O(1)的查找函数中生成一个散列表。
It generates a hash table from the predetermined list of valid command-line options and a lookup function whose time complexity is o (1).
为了解决这个问题，本文提出一种新的模式合一算法，共时间复杂度为线性的。
To solve the problem, this paper proposes a new pattern unification algorithm, which time complexity is linear.
另外，还通过计算机实验，对置乱网络的遍历时间复杂度及其置乱性质进行了分析。
The paper also analyzed the time complexity and the scrambling performance of the new networks by computer experiments.
理论上已经证明要在多项式时间复杂度内对这一类问题找到全局最优解是不可能的。
The fact that it is impossible to find the global optimum in polynomial complexity has been proved.
在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。
On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.
设计了一个具有多项式时间复杂度的算法从流程私有部分自动生成相应的公开部分。
An algorithm with polynomial complexity was presented to generate the public part of the process from its private one.
讨论了复数矩阵的数据结构和共轭转置运算的算法实现，并给出该算法的时间复杂度。
The paper deals with the data structure of plural matrix and the achievement of method about associate operation, and gives its complex degree of time.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
应用推荐