The 2-Maxsat Problem Can Be Solved in Polynomial Time

That's a pretty big deal if it's true!

A pretty big deal? If it's true, P = NP. That's the biggest deal in CS since approximately ever.

It's obviously not true

Care to back up that assertion? (And, "P=NP is obviously false, therefore this is obviously false" is restating the assertion, not backing it up.)

jjgreen 3y ago ↗

Because there are 10 claims a day that NP=P or NP!=P or Goldbach is true or Goldbach is false. Always they are wrong. I am as certain that the sun will rise tomorrow as that this is wrong.

When a proof is published in the Annals of Mathematics I'll take a look, an unreviewed paper on arxiv? hahah, no

The 2-Maxsat Problem Can Be Solved in Polynomial Time (arxiv.org)

5 comments