查询词典 NP

Owing to the strong condition of equivalence relation, there exist some limits, and It has been proved to be NP-Hard to find all reductions and a minimal reduction.

由于等价关系条件较强，有一定的局限性，已经证明求所有约简和最小约简是NP-Hard问题。

ELISA method was used for the serum PSA measurement among the 3o cases of PC sufferers. Results: 5 cases of NP were all ploidy (2C and 3-4C); 23 out of 30 PC cases were euploidy. As PC levels increased, the ploidy rate increased accordingly; in 25 cases of PC sufferers, the serum PSA was higher than normal; in 6 Out of 7 ploidy sufferers, the serum PSA was abnormal; 4 out of 5 normal PSA are euploidy.

结果：5例NP中均为整倍体（2C和3-4C），30例PC中有23例出现非整倍体，并且随着PC分级的增高，其倍体率也增大；25例前列腺癌患者血清PSA值高于正常值。7例整倍体患者6例血清PSA不正常，5例PSA正常者中4例为非整倍体。

No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.

无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。

If we had the books from Futurama that supposedly list the problems in each class, then we could compare them, see of the NP book lists any extra ones, and collect our prize money.

如果我们有飞出个未来里面的这本书，假设它把这些问题分类列出，通过对比，如果NP这本书中比另一本任意多一个，我们就可以去领奖金了。

The algorithm for generlized edit distance is NP-complete.A one-direction,low complexity document distance metric based on generalized edit distance is proposed after probing special patterns of document plagiarism.

广义编辑距离的计算是一个NP-完全问题，在充分考虑了文档抄袭行为的特点之后提出一种基于广义编辑距离的单向的低计算复杂性的文档距离度量方法。

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

由于图的着色问题属于NP完全问题，不可能在多项式时间内得到最优解。

Graph coloring problem is a NP-complete one of graph and combinatorial optimization.

图着色问题是图与组合优化中的一个NP-完全问题。

Graph Coloring Problem is one of the typical NP-hard problems in combinatorial optimization problem.

图着色问题（GCP，Graph Coloring Problem）是经典的NP-Hard组合优化问题之一。

The graph vertex coloring problem is the main topic of graph theory and applied in many fields, which is known as NP-complete problem.

图顶点着色问题存在于丰富的科学和工程应用中，如工序问题、排课表问题、物资储存问题等等，但它却是众所周知的NP-完全问题。

Because of NP property, we will propose an heuristic algorithm to solve the problem.

由于该问题是NP-完备的，我们给出了一个启发式算法。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。