The Millennium Problems
了解 Keith J. Devlin 的《The Millennium Problems》（The Millennium Problems）：2007-02-22–2026-11-01 的 Hacker News 数据中有 2 次提及、2 位讨论者。阅读原文摘录、比较不同观点，将它加入你的书单。
分享到 X社区里的声音
最近 2 条来源记录提及不等于推荐。标签来自源数据的自动分类；请打开原始讨论核对上下文。
此记录保留了作者、时间和来源链接，请打开 HN 阅读完整上下文。
在 Hacker News 阅读原文There's quite a good "layman's" explanation of the problem, including some of its history, in Keith Devlin's book "The Millennium Problems." The problem description starts on page 112. In that book he also refers to the official Clay Mathematics Institute (CMI) book that gives a summary, and then the problem in detail. He also references a short film that gives a similar outline summary. The film can apparently be found at http://www.claymath.org I'm sure there are dozens of descriptions of the "Does P=NP?" question on the 'net. Which ones have you read? What was unsatisfactory about them? Name three, tell me what you didn't like, and I'll try to find another for you, or write one myself. Note: I'm not an expert, but if my knowledge is different from yours, perhaps I can help. I have proved directly that graph 3-vertex coloring is in NPC.…
在 Hacker News 阅读原文