The Millennium Problems
Explore The Millennium Problems by Keith J. Devlin: 2 Hacker News mentions from 2 participants in 2007-02-22–2026-11-01. Read original excerpts, compare opinions and save this book.
Share on XThe Millennium Problems
2 mentions · 2 participants · 2 recommenders
Book editionFrom the conversation
Latest 2 source recordsA mention is not an endorsement. Labels are automatically classified by the source. Follow the original discussion to verify the context.
This record preserves its author, date and source link. Open HN to read the full context.
Read on Hacker NewsThere'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.…
Read on Hacker News