查询词典 Np

The planar graph 3-colorability (P3C) is one of {bf NP}-complete problem.

可平面图的可三着色性（P3C）是一个NP---完全问题。

The problem of deciding whether an arbitrary undirected planar graph $G$ is a Hamiltonian is one of six best important {bf NP}-complete problems.

判定一个任意的无向可平面图G是否是哈密顿图问题是六个重要的NP完全问题之一。

It has been proved that the grid job scheduling is a NP-complete problem, and it is hard to find an optimal solution in polynomial time by using traditional searching method.

已有文献证明，由于网格的复杂多变和任务的层出不穷，网格中的任务调度属于NP完全问题，很难用传统的搜索办法在多项式时间内找到最优解。

Almost all of these problems are NP-hard, it is very difficult to find a polynomial optimal solution. Hence, many people try to solve such problems through various methods to find suboptimal solutions instead.

分布式计算系统的任务调度是确定性调度问题中的一个重要专题，这类问题基本上都是NP难题，因此很难找到多项式时间最优算法。

As an NP-hard problem, this model has no solution based on polynomial algorithm at present. Therefore, an adaptive and polymorphic ant colony algorithm has been brought forward to solve the VRPMC.

由于该模型是一个NP-hard问题，目前还没有多项式算法求解，又提出了采用自适应的多态蚁群算法来对其进行求解的策略。

This paper presented a three-phase heuristic approach to deal with this NP-hard problem. During the process of determining the bottleneck work center, arranging the devices, and ordering the jobs, reduced the complexity of the problem gradually. Therefore obtained an effective solution within polynomial time.

针对这个NP-hard问题，提出一种三阶段启发式方法，通过依次完成瓶颈工作中心的判定、设备分配和任务排序，使这一问题的复杂度得以逐步降低，从而可以在多项式时间内得到有效的调度方案。

The multicast routing problem that finding the minimum cost multicast routing tree with many QoS constraints may be formalized to Steiner tree problem in network, which is a NP-complete problem that an algorithm that finds a Steiner tree can not get the best solution in polynomial time.

寻找有多个QoS约束的最小代价组播路由树可以形式化为网络中的Steiner树问题，它是一个NP完全问题，在多项式时间内不能得到最优解，因此研究者所寻求的是一种次优的、在最差情况和平均情况下的性能都接近于最优的解决方案。

In vivo test, the acute toxicity test of animal experiment indicated that the toxicity of PYM-CH-NP is lower than that of PYM.

动物的急性毒性试验表明，PYM-CH-NP降低了PYM的急性毒性作用。

Raveling Salesman Problem is a classic combined optimization problem and it is proved that TSP is NP hard.

SP问题作为经典的组合优化问题，已经被证明是一个NP难题。

The progress of reaction kinetics between organic reductant s and Np, Pu is reviewed briefly in the paper.

概要评述了近 2 0年来有机还原剂与Np和Pu的氧化还原反应动力学研究进展，讨论分析了有关反应机理和动力学物化参数，以期为乏燃料后处理流程提供依

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.

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