The 2-MAXSAT Problem Can Be Solved in Polynomial Time
Well, this is somewhat heartbreaking for me. I haven&#x27;t read the paper, but the result sounds very plausible to me.<p>I am also an amateur working on P=NP. Last week, I think I also proved that P=NP, but with a different method, and was about to seek publication.<p>My result seems very similar to his, yet very different. I can prove that class of SAT which is intersection of 2SAT and XORSAT is NP-complete by reduction to 3-SAT. Then I follow the approach in Melville&#x27;s Krom 1967 paper on 2-SAT, and prove that certain polynomial-sized logic (that corresponds to the intersection) is refutable complete. So you can essentially generate all formulas in that logic and if you don&#x27;t find contradiction, the instance is satisfiable.<p>I have also did some preliminary testing of my method, and was able to factor small integers with it. However, there was a bug.<p>So, to sum up, I am not surprised that P=NP with a constructive and efficient algorithm. Take it for what you want. The future is gonna be interesting (crypto DOOMSDAY).