• 1. NP-complete: 问题 | 难的
• 2. NP complete: NP完全
• 3. NP-complete problems: NP完全问题

更多释义

• 1.The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
  图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
  dict.yoduao.com
• 2.Assuming you are looking for general case answer, I am sorry to say - but this problem is NP-Complete.
  假设你正在寻找的答案一般情况下，我很抱歉，但是这个问题NP完全。
  dict.yoduao.com
• 3.Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
  某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
  dict.yoduao.com

©2026 网易公司