News for hackers. Stuff that matters.
Re:A proof P = NP was accidentally published in TOCT by jcranmer on Monday July 19, 2021 @06:44PM (#27888138)
At first glance, it's trying to solve 3SAT by using a 2SAT algorithm. I haven't followed it in detail, but my guess is that the error is that the algorithm accumulates an exponential set of possibilities rather than a polynomial set. (It's a bit hard to follow due to excessive use of custom terminology.)

There are no comments on this comment yet.