News for hackers. Stuff that matters.
Re:How to solve an NP-complete problem in linear time by votepaunchy on Friday June 21, 2019 @04:33PM (#20246094)
Demonstrates a clear lack of understanding of NP-completeness.

From the blog: "There is a million dollar prize on offer for a solution to the P vs. NP problem, so it’s understandable that one may wonder whether this blog post is an official entry. It is not."

From [1]: "If any NP-complete problem has a polynomial time algorithm, all problems in NP do."

[1] https://en.wikipedia.org/wiki/NP-completeness

There are no comments on this comment yet.