但该类问题推测属于NP完全问题。
However, this kind of problem is conjectured to be a NP complete problem.
图着色问题是著名的NP-完全问题。
经证明，生产调度问题是NP完全问题。
Production scheduling problem has been shown to be a NP complete problem.
多点网络拓扑结构设计问题是NP-完全问题。
The problem of multipoint network topological design is NP-complete.
一般情况下，这种DAG调度是个NP完全问题。
The DAG scheduling problem has shown to be NP complete in general.
最小路径集和流量分配问题(MPSFAP)是NP完全问题。
Minimum path set and flow allocation problem (MPSFAP) were NP complete problems.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability problem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability problem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.
应用推荐