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中一个重要的问题，译者注)。

youdao

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完全问题的最佳解决方案就可以立马搞定。

youdao

Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.

某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。

youdao