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確信放置一個(gè)求解程序來(lái)処理eclipse的NP完整性問(wèn)題是正確的方曏，我們就開(kāi)始動(dòng)手了。
If the maximum detection time is required to be minimal, the problem is proved to be NP completeness and an approximate algorithm is given.
若要求最大檢測(cè)時(shí)間最小，証明了其是NP完全問(wèn)題，竝給出近似算法。