np completeness

基本解释

It is one of the considerably complicated scheduling problems due to its NP-completeness.
由于其本身具有NP-完全的性质，求解具有很大的难度。
Once the PMC got convinced that putting a solver tackling NP-completeness in eclipse was the right way to go, we were set.
一旦PMC确信放置一个求解程序来处理eclipse的NP完整性问题是正确的方向，我们就开始动手了。
If the maximum detection time is required to be minimal, the problem is proved to be NP completeness and an approximate algorithm is given.
若要求最大检测时间最小，证明了其是NP完全问题，并给出近似算法。