全部

1·In general, constraint satisfaction problems are NP-Complete.

一般而言，约束满足问题是NP完全的。

2·The problem of multipoint network topological design is NP-complete.

多点网络拓扑结构设计问题是NP-完全问题。

3·The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.

图的最小顶点覆盖问题是图论中的一个NP完全问题。

4·The problem of fault detection in general combinational circuits is a NP-complete problem.

组合电路的故障检测问题是一个NP完全问题。

5·The optimal layout for rectangular part is a NP-complete combinatorial optimization problem.

矩形件优化排料是一类具有NP完全难度的组合优化问题。

6·The crossing number of graph, which is an NP-complete problem, has an important theory meaning.

图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。

7·The third problem has been proved to be NP-complete, but there are few practical algorithms for it.

第三个问题已被证明是NP完全问题，但这个问题的实际算法还没有。

8·SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.

SAT问题是第一个NP-完全问题，并且是一大类NP-完全问题的核心。

9·Assuming you are looking for general case answer, I am sorry to say - but this problem is NP-Complete.

假设你正在寻找的答案一般情况下，我很抱歉，但是这个问题NP完全。

10·The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.

最大团问题是组合优化中的一个经典的NP -完全问题。