网络释义专业释义英英释义
NP complete NP完全
NP-complete problems NP完全问题
NP-complete problem NP完全问题
strongly np-complete 强np完全
np complete problems np完全问题
np-complete set NP完全集
np-complete theory np完全理论
np complete theory np完全理论
NP-complete
- abstract: In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC) is a class of decision problems. A decision problem L is NP-complete if it is in the set of NP problems and also in the set of NP-hard problems.
以上来源于: WordNet
双语例句
-
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
-
Assuming you are looking for general case answer, I am sorry to say - but this problem is NP-Complete.
假设你正在寻找的答案一般情况下，我很抱歉，但是这个问题NP完全。
-
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
应用推荐