np completeness

基本解釋

It is one of the considerably complicated scheduling problems due to its NP-completeness.
由於其本身具有NP-完全的性質(zhì)，求解具有很大的難度。
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完全問題，竝給出近似算法。