np-complete theory np完全理论
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
It belongs to NP complete problem in theory, so it's hard to solve in practical problems.
在理论上属于NP完全问题，在实际问题上很难解决。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
应用推荐