该词条未找到_海词词典

您要查找的是不是：

An Algorithm with Polynomial Time Complexity for Verifying Secrecy Properties of Cryptographic Protocols 一种多项式时间复杂度的密码协议秘密性验证方法
polynomial time complexity 多项式时间复杂性
Accordingly, this paper offered optimized algorithm for reduction of knowledge, of which time complexity was polynomial. 在此基础上提出了优化的知识约简算法，该算法的时间复杂度是多项式的。
It discusses ACA's time complexity and space complexity. 讨论了它们的时间复杂度和空间复杂度。
Introduction, algorithm, ADT, space and time complexity, binary search, etc. 课程介绍；算法概念；数据抽象；性能分析。
The paper offers polynomial time algorithm of the functional all-terminal reliability of cordal ring. 给出了弦环的实用全终端可靠度的一种计算方法;此方法是多项式时间的.
Theorem 4.1 Algorithm 4 can solve the problem (P) by using at most 2k-1 matchings in polynomial time. 定理4.;1 算法4能够在多项式时间内给出问题（P）的一个用2k-1次匹配的解。
Finally, a polynomial time algorithm for solving an optimal cover of FD set is given. 最后给出了一个求FD集最优覆盖的多项式时间算法。
But the language constructed there is indeed an unnatural one because the construction needs to run all polynomial time Turing machines. 但 Lander给出语言并不是一个自然的语言因在该语言的构造中需运行所有多项式时间的图灵机 .
It is impossible to tackle all combinatorial optimization problems (COP) in deterministic polynomial time with accurate solution. 由于组合优化问题的解空间十分庞大，使用精确求解方法无法在确定多项式时间内求得它的最优解。
Yet, it cannot be expected that an algorithm can find, in polynomial time, a solution to an arbitrary GCP instance, because the GCP is NP-hard. 由于对于任意一个图着色例子而言，没有一种算法可以在多项式的时间内找到它的解，因此图的着色问题是一个NP难的问题。
Meantime,the polynomial time algorithm is suggested.The method provides a new way for the bilevel decision problem and multi-level decision making. 同时，在上下层问题独立求解时，引入了一种多项式的时间算法，为两层以及多层决策问题提供了新的求解途径。
But they still have disadvantages, such as high time complexity and the requirement of "num +". 但是它有算法时间复杂度比较高，需要预先设置正负例比例等不足。
The second algorithm takes polynomial time in the size of input.This algorithm effectively finds a minimum cover for FDs propagated from XML keys. 第二个算法需要花费输入集合的多项式时间倍,此算法有效地计算来自XML关键字的函数依赖最小覆盖的算法。
It's commonly believed that no polynomial time algorithms exist for such formula satisfiability problems,since they belong to the NPC class. 布尔表达式的判定是NPC问题，用回溯法就能解决这一问题（只要变量不是很多）。
In this paper, we study the undirected minimum-cardinality feedback vertex set problem in outer-planar graphs and present a polynomial time algorithm to solve it. 本文讨论外平面图的反馈点集并给出了一个求外平面图最小反馈点集的多项式时间算法。
This paper introduces a map sort algorithm with extra memory cost, its time complexity is O(N). 本文介绍了映射式排序算法,这种算法附加一定的存储开销,时间复杂性为O(N)。
Devise a genetic algorithm to solve the Economic Lot and Delivery Scheduling Problem-ELDSP, and compared with heuristic algorithm and polynomial time algorithm. 设计了基于经济批量与交货期问题(ELDSP)的遗传算法。
The time-constrained algorithm has time complexity of O(n 2),where n is the number of nodes in the DFG. 该算法的时间复杂性为O(n2 ) ;n是DFG图中的结点个数 .
The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system. 内点法是一种求解线性规划问题的多项式时间算法,其显著特征是其迭代次数与系统规模关系不大。