英汉例句

• a polynomial time approximation scheme (ptas) for this problem is presented.

  给出了一个多项式时间近似方案（ptas）。

• a polynomial time algorithm is developed for the restricted version in which the jobs in each group have the same due date.

  对同组工件有相同工期的限制情形给出了一个多项式算法。

• this paper presents a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.

  因此，我们为其设计了一个多项式时间的贪心算法以及一个将贪心策略和分支限界策略集合在统一框架下的复合算法。

• both theoretic analyses and testing results show that the new method is a deterministic polynomial time algorithm.

  理论分析与实验结果表明该方法是确定性的多项式时间算法。

• both of them are polynomial time algorithms. because of their inherent characteristic of hierarchical and entire space, the global routing is suitable for large scale multi layer routing.

  该算法由块内布线算法和块间布线算法两部分组成，它们的时间复杂性均为多项式时间算法。

• second, a fully polynomial time approximation algorithm is used here to calculate the capacity upper bound of multi-channel ad hoc networks.

  之后，利用完全多项式时间近似算法对多信道自组织网络的理论性能进行了研究。

• in spite of its npc property, the problem can be solved in polynomial time if the number of literals in a clause is limited to 2 (2-sat).

  虽然sat问题是np完全问题，但在每个子句的长度小于等于2（2-sat）的情况下是可以在线性时间判定其可满足性的。

• a new technique to design polynomial time approximation schemes(ptas) for np hard problems in euclidean space is introduced.

  提出了一种在欧氏平面上设计多项式时间近似方案的新技术。

• 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.

  内点法是一种求解线性规划问题的多项式时间算法，其显着特征是其迭代次数与系统规模关系不大。

• a algorithm with central line neighbour hood of polynomial time for linear programming is given.

  给出二次锥规划的一种不可行内点算法并证明该算法是多项式时间算法。

• a problem that is polynomial time equivalent to graph isomorphism is called isomorphism complete.

  凡多项式时间等价于图同构检验的问题称为同构完全问题。

• polynomial time algorithms are given for some special types of connected assignment.

  对某些特殊类型的分配问题，给出了多项式复杂性的分配算法。

• basing on the optimal properties, this paper proposes a polynomial time algorithm which is suitable to solve the large scale scheduling problem.

  本文在利用优化性质的基础上，提出了一种适于大规模优化调度问题的多项式时间算法。

• the author study the minimum cost flow problem with not only fixed cost but also variable cost, and they found it be a mixed 0-1 linear program, and it does not have polynomial time algorithm.

  研究了带容量限制的带固定费用和可变费用的最小费用流问题，发现该问题是混合0-1整数规划问题，不存在多项式算法。

• to relate message with graph, we give a constructing algorithm based on one-way permutation, then prove that it doesn「t exist a probably algorithm for polynomial time to find a「collide」.

  为了把报文与图联系起来，采用了基于单向置换的报文摘要生成算法，并证明了对该算法而言，不存在多项式时间的概率算法来找到一个「沖突」。

• sat problem belongs to the np class, that is, theoretically it can」t be solved in polynomial time and solving it exceeds the capability of modern computer.

  sat问题是np完全问题，从理论上说，sat问题不能在多项式时间内解决，它超出了现代计算机的能力。

• they are provably secure based on pseudo- random synthesizers, in our scheme, the sender may be unbounded to polynomial time and the receiver is bounded.

  该方案的安全性是基于伪随机合成器的存在性，承诺者可以拥有无限的计算资源。

• an integer programming formulation for channel assignment problem with channel loading is presented and polynomial time algorithms are designed for some special radio networks in this paper.

  给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。

• in this paper, we present a new match protocol. it is of semantic security: there exists no probabilistic polynomial time algorithm to distinguish two guessed inputs.

  本文给出了一个新的匹配协议，该协议是语义安全的，不存在概率多项式时间算法区分对两个输入的猜测值。

• for the parsimony this paper presents model a polynomial time greedy algorithm and a compound algorithm that combines the greedy policy with the branch-and-bound strategy in a uniform framework.

  提出了节约原则模型的一个多项式时间的贪心算法以及一种把贪心策略和分支限界策略集合在统一框架下的复合算法。

• theorem2.1: algorithm2.1 is a polynomial time approximation scheme theorem2.2 when algorithm2.1 end, the path between each node pairs which.

  定理2．1：算法2．1是一个多项式时间近似方案定理2．2 程序结束时每个要求所对应的两点之间的路径是唯一的。

• finally, a polynomial time algorithm for solving an optimal cover of fd set is given.

  最后给出了一个求fd集最优覆盖的多项式时间算法。