NP-hard problem NP困难问题 ; 困难问题 ; NP难度问题
NP - hard problem NP完全问题
Strongly NP-hard Knapsack Problem 强NP难背包问题
The fill in problem for graphs is a well known NP hard problem.
图的最小填充问题是熟知的NP-困难问题。
Automatic test paper generation is a NP hard problem while restrictions exist.
试题库自动组卷问题是一个NP难题。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
应用推荐