polynomial time发音

意思翻译

多项式时间

相似词语短语

polynomial───n.多项式；多词拉丁学名；表示任何多项数之和；adj.多项的，多词的；多项式的

chromatic polynomial───色多项式

characteristic polynomial───[数]特征多项式

invariant polynomial───不变多项式

polynomial equation───[数]多项式方程

annihilating polynomial───湮灭多项式

polynomial function───n.[数]多项式函数

trigonometric polynomial───[数]三角多项式

factor polynomial calculator───因子多项式计算器

双语使用场景

A polynomial time approximation scheme (PTAS) for this problem is presented.───给出了一个多项式时间近似方案(PTAS)。

This paper presents a polynomial time algorithm for finding Rectilinear-Steiner-Trees by statistical analysis.───本文利用统计分析法，提出求解矩形斯坦纳树问题的多项式时间算法。

Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.───例如 Shor 的算法能在多项式时间内找到一个 N 位函数的周期。

But the square root does not transform an exponential time into a polynomial time; it just produces a smaller exponential.───不过开平方，并不能将指数时间转换成多项式时间，只是将指数幂次减半而已。

A polynomial-time algorithm, which effectively produces the optimal transport scheme, is presented for this generalized model.───文中给出了推广模型的多项式时间算法，它能相对快速地找到最优运输方案。

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）的情况下是可以在线性时间判定其可满足性的。

Finally a polynomial-time algorithm for the optimal strategy of OEM is gotten by using dual theory of bilevel programming.───最后，利用双层规划的对偶理论，给出求解OEM业务最优策略的一种多项式时间算法。

The polynomial-time algorithm can effectively produce the optimal transport scheme.───该算法能够较快地找到最优运输方案。

The vehicle scheduling problem is a NP-hard problem without polynomial time algorithm.───车辆调度问题是一个NP-难问题，不存在多项式时间算法。

英语使用场景

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.

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.

Polynomial time approximation schemes ( PTASs ) for both the undirected and the directed cases are presented.

Because graph coloring problem belongs to NP complete problems, it can not get the optimal solution in polynomial time.

In addition, it has been illustrated that job-shop scheduling is usually an NP-hard combinatorial problem and is therefore unlikely to be solvable in polynomial time.

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.

More interesting are problems where the answers can be written down, and even checked for correctness, in polynomial time.

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.

Under weighted hamming distance, some properties of this problem are given and also present a polynomial time algorithm to solve this problem.