3 ms·
The 2-Maxsat Problem Can Be Solved in Polynomial Time
- WantonQuantum 3y agoThat's a pretty big deal if it's true!
- AnimalMuppet 3y agoA pretty big deal? If it's true, P = NP. That's the biggest deal in CS since approximately ever.
- jjgreen 3y agoIt's obviously not true
- AnimalMuppet 3y agoCare 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 agoBecause 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