主题：【原创】ｐ（多项式算法）问题对ｎｐ（非多项式算法）问题　 -- 香山居士

of NP problems.

when you talk "如果你解决了一个NP问题,你就解决了所有的NP问题!", you are talking about NO-Complete problems. In fact, there are many hard problems which have no NP algorithms to solve them, and they are so far not proven to be NP-Complete.

correct me, if i am wrong.

你说的没错，我写的不太严格。