zhiqiang, September 14, 2006 @ 9:32 am · Filed under 计算机科学 · 4 Comments
前面已经提到了显示中大多数难解问题问题最后都被证明是NP-完全问题。这意味着，除非NP=P，它们是不可能有多项式时间算法的（而且，在这篇文章提...... 约1830字，阅读全文
Ph.D Candidate from iTCS & CASTU, Tsinghua Univeristy, major in Applied Mathematics (Theoretical Computer Science)
This blog focuses on (computer) science, reviews( books), blog(WordPress), personal thinking and stuffs.
Contact me by Email
Personal blog of zhiqiang