PNP

基本解釋

Notice I didn't say equal, I've said equivalent, just like in P = NP.
請注意，我并沒有說相等，我說的是相當，就像P = NP里的那樣。
The "P versus NP problem" asks whether these two classes are actually identical; that is, whether every NP problem is also a P problem.
“P 與NP 問題”所要解答的就是這兩類問題是否實際上是同類的：也就是說，是否每個NP 類問題也是個P 類問題。
I have studied the subject in my CS grad, but admittedly I don't know the advanced math to follow these proofs (P = NP? is one of the Clay Institute's Millennium Problems for a good reason.)
我在做計算機科學系學生時研究過這個題目，但說實話，我的高等數(shù)學的水平還達不到看懂這些證據(jù)的水平（P = NP? 是克雷數(shù)學研究所提出的七個千禧年數(shù)學問題中的一個。）