NP-complete problem NP完全问题
Sequence alignment is a NP Complete problem and a great challenge to any quick and accurate algorithms.
多序列比对问题是NP完全问题，研究快而精确的算法是一个巨大的挑战。
Moreover, to design a storage scheme for both memory access conflict free and network alignment conflict free is also a NP Complete problem.
另外设计同时满足存储访问无冲突和互联网络无冲突的存储方案设计问题也是一个NP完全问题。
In principle, by putting a set of entangled qubits into a suitably tuned magnetic field, the optimal solution to a given NP-complete problem can be found in one shot.
基本上，通过将一组纠缠的量子放置于一适宜调谐的磁场中，那么给定的NP完全问题的最佳解决方案就可以立马搞定。
应用推荐