The semidefinite programming have the advantage of faster convergence and fewer iteration in solving the combinational optimization problems and 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中一个重要的问题，译者注)。
应用推荐