1) NP-hardness
NP困难性
1.
In addition, we point out the error of Albers and Brucker(1993) s proof on the ordinary NP-hardness of the poblem.
关于此问题，Albers和Brucker（1993）也曾试图给出NP困难性证明，我们阐明了其证明中存在的缺陷。
2) strongly NP hardness
强NP困难性
4) NP-hard
NP-困难
1.
Corresponding to the following cases that the width of the due window is given and the site of the due window is free,listed five properties about it and proved it is NP-hard.
关于共同宽容交货的单机排序问题,对于宽容区间大小给定,位置不固定的情况,给出了5条性质,证明该问题是NP-困难的。
2.
(3) The problem “determining the Menger’s number of a graph” is NP-hard.
(3)“确定图的Menger数”问题是NP-困难的。
3.
Considering m-machine flow-shop problem with delays and release times, we use 3-Partition to prove that the F2RD problem is NP-hard in the strong sense, and then we introduce a simple heuristic and prove that the worst-case performance is (m+1)/2.
研究流水作业时间表问题,在具有延迟时间的条件下证明该问题是强NP-困难的。
5) NP-hard
NP困难
1.
The problem is proved to be NP-hard by an instance that the polynomial of the knapsack problem is reduced to this problem.
针对Hamming距离下的最短路逆问题,分析了最优解的性质,给出并证明了问题存在可行解的充分必要条件;利用把背包问题的实例多项式归约到该问题的实例,证明了该问题为NP困难的,为设计该类问题的近似算法提供了理论依据。
2.
The optimal layout problem of circle group in a circular container with performance constraints of equilibrium belong to NP-hard problem.
带平衡性约束的圆集在圆容器内的布局优化问题,属于NP困难问题。
6) strongly NP-hard
强NP困难
1.
We show that both the reverse problems are strongly NP-hard.
我们将证明这两个逆网络选址问题都是强NP困难的。
补充资料：混合性呼吸困难
混合性呼吸困难
肺源性呼吸困难的一个类型。在广泛性肺部病变时，呼吸面积减少，出现阻塞性与限制性呼吸功能障碍，表现为呼气和吸气均感困难而费力，呼吸频率增加，潮气量减少。见于广泛性肺纤维化、大块肺不张、重症肺炎、大量胸腔积液、重度气胸等。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条