Quadratic programming (QP) is an NP complete problem.
二次规划(QP)为NP完全问题。
It belongs to NP complete problem in theory, so it's hard to solve in practical problems.
在理论上属于NP完全问题，在实际问题上很难解决。
Sequence alignment is a NP Complete problem and a great challenge to any quick and accurate algorithms.
多序列比对问题是NP完全问题，研究快而精确的算法是一个巨大的挑战。
People always expect to find out minimum reduction, but it has already been proved that it is a NP complete problem.
人们总期望找到最小约简，但这已被证明是一个NP完全问题。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
Moreover, to design a storage scheme for both memory access conflict free and network alignment conflict free is also a NP Complete problem.
另外设计同时满足存储访问无冲突和互联网络无冲突的存储方案设计问题也是一个NP完全问题。
In this paper, the problem to design a conflict free access storage scheme for arbitrary templates set is proved to be a NP Complete problem.
本文证明了为任意模板集设计存储访问无冲突非线性存储方案的问题是一个NP完全问题。
Grid resource scheduling problem is proved to be an NP complete problem, and genetic algorithms are proved to be sharpen tools to solve NP-complete problem.
网格资源调度问题被证明是一个NP完全问题，而遗传算法是解决NP完全问题的锐利工具。
When the number of devices in a layout is more than 15, this problem will turn to a NP complete problem, only by a heuristic algorithm can an approximate optimum solution be found.
当布局设备多于15台的时候，此类问题就变成了NP完全问题，只能利用启发式算法求出近似的最优解。
Therefore, finding an effective algorithm to solve the container loading problem is quite meaningful to solving the practical problems of container loading and to calculating NP complete problem.
因此，寻找一个有效的解决集装箱装载问题的算法对于解决集装箱装载的实际问题以及求解NP完全问题都具有非常重要的意义。
Most of the research in Computer Science these days is devoted to time efficiency, particularly the theoretical time barrier of NP-Complete problems (like the Traveling Salesman problem).
不过现如今的许多计算机科学研究更加关注时间效率，特别是NP完全问题中的理论时间边界(比如旅行商人问题，这是完全NP中一个重要的问题，译者注)。
In principle, by putting a set of entangled qubits into a suitably tuned magnetic field, the optimal solution to a given NP-complete problem can be found in one shot.
基本上，通过将一组纠缠的量子放置于一适宜调谐的磁场中，那么给定的NP完全问题的最佳解决方案就可以立马搞定。
Assuming you are looking for general case answer, I am sorry to say - but this problem is NP-Complete.
假设你正在寻找的答案一般情况下，我很抱歉，但是这个问题NP完全。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
Because TSP is known to be a NP - complete problem in theory, it is too difficult to be solved with traditional optimal methods.
由于TSP问题在理论上属于NP完备问题，很难用一般的算法求解。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
This paper discusses the NP-complete multi-constrained path problem, and a precomputation source routing algorithm based on limited selective flooding is presented.
该文研究了多限制路径选择问题，提出了一种基于有限选择洪泛的源路由预计算的服务质量路由算法。
Traveling salesman problem(TSP) is a NP complete combinatorial optimum problem.
旅行商问题是NP完全的组合优化问题。
The vessel stowage planning is not only a complex combination and optimization problem, but also a NP-Complete problem.
大型集装箱船舶配载问题是一个复杂的组合优化问题，而且是一个NP问题。
Computing the diagnosis action sequence with minimum cost is a NP-Complete problem if diagnosis actions are dependent.
在诊断操作相关的情况下，求解最小代价的诊断操作序列的过程是一个NP完全问题。
The channel assignment problem belongs to the class of NP complete optimization problems, so we propose a new fixed channel assignment approach based on genetic algorithms.
信道分配问题属于组合优化中的NP完备问题，为此在遗传算法的基础上提出了一种新的固定信道分配方法。
Aiming at the critical areas coverage NP-complete problem in Wireless Sensor Networks (WSN), this paper proposes a critical areas coverage Heuristic Optimization (CACHO) algorithm.
针对无线传感器网络关键区域覆盖NP完全问题，提出一种关键区域覆盖启发式优化(CACHO)算法。
The third problem has been proved to be NP-complete, but there are few practical algorithms for it.
第三个问题已被证明是NP完全问题，但这个问题的实际算法还没有。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的NP -完全问题。
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完全问题，已被证明在多项式时间内得不到最优值。
The problem of fault detection in general combinational circuits is a NP-complete problem.
组合电路的故障检测问题是一个NP完全问题。
Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.
本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。
SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.
SAT问题是第一个NP-完全问题，并且是一大类NP-完全问题的核心。
SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.
SAT问题是第一个NP-完全问题，并且是一大类NP-完全问题的核心。
应用推荐