Quod Erat Demonstrandum

2010/08/20

P/NP

Filed under: Report,University Mathematics — johnmayhk @ 11:28 上午

P/NP問題是在理論信息學中計算複雜度理論領域裡至今沒有解決的問題,它被「克雷數學研究所」(Clay Mathematics Institute,簡稱CMI)在千禧年大獎難題中收錄。

摘自

http://zh.wikipedia.org/zh-tw/P/NP%E9%97%AE%E9%A2%98

新近的相關報導:

http://www.nytimes.com/2010/08/17/science/17proof.html?_r=1

3 則迴響 »

  1. I think the problem name is “P ?= NP" or “P = NP". Anyway, this claimed proof has stirred up a really big discussion and response in the computer science community. And it is still unknown whether the proof is correct or not, still very much argument going on. But even if it’s incorrect, the proof still has provided some certain inspiring new techniques that may be used in the future.

    迴響 由 Anonymous — 2010/08/22 @ 10:48 下午 | 回覆

  2. Great information! Signed, Musatov

    迴響 由 Martin Musatov — 2012/07/07 @ 3:54 上午 | 回覆


RSS feed for comments on this post. TrackBack URI

發表迴響

在下方填入你的資料或按右方圖示以社群網站登入:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / 變更 )

Twitter picture

You are commenting using your Twitter account. Log Out / 變更 )

Facebook照片

You are commenting using your Facebook account. Log Out / 變更 )

Google+ photo

You are commenting using your Google+ account. Log Out / 變更 )

連結到 %s

在WordPress.com寫網誌.

%d 位部落客按了讚: