...NP完全问题 [gap=1010]matical problems;deterministic turing machines;nondeterministic turing machines;NP complete problems ...
基于6个网页-相关网页
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完全问题中的应用。
Most of the research in Computer Science these days is devoted to time efficiency, particularly the theoretical time barrier of NP-Complete problems (like the Traveling Salesman problem).
不过现如今的许多计算机科学研究更加关注时间效率，特别是NP完全问题中的理论时间边界(比如旅行商人问题，这是完全NP中一个重要的问题，译者注)。
应用推荐