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完全问题，并给出近似算法。
It is one of the considerably complicated scheduling problems due to its NP-completeness.
由于其本身具有NP -完全的性质，求解具有很大的难度。
Finally, the article discusses the significance of researching into the theory of NP-completeness.
最后，文章着重指出了研究NP -完全性理论的意义。
Finally, the article discusses the significance of researching into the theory of NP-completeness.
最后，文章着重指出了研究NP -完全性理论的意义。
应用推荐