全部

1·Maximum power estimation is a NP-hard problem.

最大功耗估计问题是一个NP难题。

2·Recent studies show that the problem is NP-hard.

最近的研究成果表明这一问题是NP难问题。

3·We show that both the reverse problems are strongly NP-hard.

我们将证明这两个逆网络选址问题都是强np困难的。

4·Test set problem is a NP-hard problem with wide applications.

测试集问题是一个有着广泛应用的NP难问题。

5·But it is a NP-Hard problem to get the minimal attribute reduction.

但求取任意问题的最小属性集是一个NP难问题。

6·The max-cut problem is a standard NP-hard problem in graph graphic theory.

最大割问题是图论中的一个典型的NP困难问题。

7·The minimum distance decoding of linear codes is NP-hard, but some solvable cases exist.

线性分组码的最小距离译码是NP -难问题，但有些情况可解。

8·It has been proved that computing most of these new vulnerability parameters are NP-hard.

但已被证明的是计算一般图的这些参数是NP-困难问题。

9·It is known that the problem is APX-hard for general graphs and NP-hard for planar graphs.

此问题在一般图下是APX困难问题，在平面图下是NP困难问题。

10·Solving NP-hard problems is always the bottleneck task in the field of computer science and technology.

求解np难度问题一直是计算机科学技术的一个瓶颈任务。