np completeness

基本解釋

• [計(jì)算機(jī)科學(xué)技術(shù)]非決定性多項(xiàng)式完全性

英漢例句

雙語(yǔ)例句

• 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)題是正確的方向，我們就開始動(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)題，并給出近似算法。

• np completeness更多例句

詞組短語(yǔ)

短語(yǔ)

• NP -completeness 完全問(wèn)題
• Coping with NP -completeness 處理NP完全問(wèn)題;處置NP完整題目

• np completeness更多詞組

專業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 非決定性多項(xiàng)式完全性