Minimum path set and flow allocation problem (MPSFAP) were NP complete problems.
最小路径集和流量分配问题(MPSFAP)是NP完全问题。
In this paper, hairpin structure and molecular beacons are applied in solving a few NP complete problems.
本文主要给出发夹结构及分子信标在几个NP完全问题中的应用。
The security of these new cryptosystems depends on some NP-complete problems in the theory of Diophantine equations and on the difficulty of large number decomposition.
这些体制的安全性依赖于求解丢番图方程中的一些NP完全问题和大数的素因子分解的困难性。
应用推荐