Job shop scheduling is a typical NP problem.
车间作业调度是典型的NP难题。
Recent studies show that the problem is NP-hard.
最近的研究成果表明这一问题是NP难问题。
Minimum Steiner tree problem is NP complete problem.
图着色问题是著名的NP-完全问题。
Test set problem is a NP-hard problem with wide applications.
测试集问题是一个有着广泛应用的NP难问题。
The fill in problem for graphs is a well known NP hard problem.
图的最小填充问题是熟知的NP-困难问题。
The problem of determining such a constrained tree is NP complete.
确定这样一棵约束树的问题是NP-完全的。
The DAG scheduling problem has shown to be NP complete in general.
一般情况下，这种DAG调度是个NP完全问题。
Power network planning is a NP hard problem difficult to be solved.
电网规划是一个较难解决的NP难问题。
We show that the scheduling problem is NP-hard in the strong sense.
本文证明了上述排序模型是强NP困难的。
Is this a correct understanding of proving something is NP Complete?
这是一个正确的理解证明是NP完整吗？
In English, the subject NP of an imperative sentence can be deleted.
在英语中，这个主题党的祈使句可以删除。
The problem of multipoint network topological design is NP-complete.
多点网络拓扑结构设计问题是NP-完全问题。
However, this kind of problem is conjectured to be a NP complete problem.
但该类问题推测属于NP完全问题。
Production scheduling problem has been shown to be a NP complete problem.
经证明，生产调度问题是NP完全问题。
Automatic test paper generation is a NP hard problem while restrictions exist.
试题库自动组卷问题是一个NP难题。
And that now must be the frictional force, because NP is still the frictional force.
这肯定是摩擦力，因为NP还是摩擦力。
Minimum path set and flow allocation problem (MPSFAP) were NP complete problems.
最小路径集和流量分配问题(MPSFAP)是NP完全问题。
Because of NP property, we will propose an heuristic algorithm to solve the problem.
由于该问题是NP -完备的，我们给出了一个启发式算法。
Because the location model is an NP problem, we solve the problem with heuristic arithmetic.
由于选址模型是NP问题，采用启发式算法进行求解。
The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
应用推荐