The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
However, this kind of problem is conjectured to be a NP complete problem.
但该类问题推测属于NP完全问题。
Minimum Steiner tree problem is NP complete problem.
图着色问题是著名的NP-完全问题。
Production scheduling problem has been shown to be a NP complete problem.
经证明，生产调度问题是NP完全问题。
Production scheduling problem has been shown to be a NP complete problem.
经证明，生产调度问题是NP完全问题。
应用推荐