查询词典 NP

Although finding the Minimum Connected Dominating Set in an arbitrary graph is a NP-bard problem, many approximation algorithms have been proposed to construct a serviceable CDS.

由于求解最小连通支配集是一个NP难问题，许多近似算法被提出用于构建可用的最小连通支配集。

But the attribution reduction is a NP problem,and it needs to be realized by knowledge of elicitation method.

引言粗糙集理论是Pawlak等学者在1982年提出的处理不确定，不精确和不完全数据的一种新的数学工具，主要用于知识的简化及知识依赖性的分析[1]。

These data suggest that treatment with DL reduces systemic eosinophilia and prevents the increase in circulating eosinophils after NP.

DL治疗能抑制全身性嗜酸性粒细胞增多，防止鼻部刺激引起的循环嗜酸性粒细胞增多。

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-完全问题。

Salt is good, but if the salt becomes flat and tasteless, with what do you season it?

14：33 盐本是好的，盐若失了味，可用什么叫它再咸呢？

He reiterated that the PLA is an army of the people under the leadership of the Communist Party of China.

他重申，人民解放军是在中国共产党领导下的人民军队。