In general, constraint satisfaction problems are NP-Complete.
一般而言，约束满足问题是NP完全的。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
The problem of multipoint network topological design is NP-complete.
多点网络拓扑结构设计问题是NP-完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
The problem of fault detection in general combinational circuits is a NP-complete problem.
组合电路的故障检测问题是一个NP完全问题。
The optimal layout for rectangular part is a NP-complete combinatorial optimization problem.
矩形件优化排料是一类具有NP完全难度的组合优化问题。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
The third problem has been proved to be NP-complete, but there are few practical algorithms for it.
第三个问题已被证明是NP完全问题，但这个问题的实际算法还没有。
SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.
SAT问题是第一个NP-完全问题，并且是一大类NP-完全问题的核心。
Assuming you are looking for general case answer, I am sorry to say - but this problem is NP-Complete.
假设你正在寻找的答案一般情况下，我很抱歉，但是这个问题NP完全。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的NP -完全问题。
Computing the diagnosis action sequence with minimum cost is a NP-Complete problem if diagnosis actions are dependent.
在诊断操作相关的情况下，求解最小代价的诊断操作序列的过程是一个NP完全问题。
The vessel stowage planning is not only a complex combination and optimization problem, but also a NP-Complete problem.
大型集装箱船舶配载问题是一个复杂的组合优化问题，而且是一个NP问题。
However, these kinds of problems are NP-Complete, and it is difficult to give optimal solution within a reasonable time limit.
然而，裁剪与装填问题是NP-完全问题，很难在有限的合理时间内取得最优解。
The results indicate that the proposed algorithm can quickly obtain the satisfactory solutions of this type of NP-complete problems.
实验结果表明，该算法能在较短时间内给出这类NP完备问题的满意解。
This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和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完全问题的最佳解决方案就可以立马搞定。
The security of these new cryptosystems depends on some NP-complete problems in the theory of Diophantine equations and on the difficulty of large number decomposition.
这些体制的安全性依赖于求解丢番图方程中的一些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)算法。
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中一个重要的问题，译者注)。
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中一个重要的问题，译者注)。
应用推荐