polynomial time的意思

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.