Comment on The 2-MAXSAT Problem Can Be Solved in Polynomial TimeComments−marcodiego3y"Hence, we provide a proof of P = NP."Now map a big, critical and difficult problem to the 2-Maxsat problem, solve it in polynomial time, get rich and come back to argue if it is really a proof of P = NP.−local_crmdgeon3yPolynomial time can still be truly enormous
Comments
"Hence, we provide a proof of P = NP."
Now map a big, critical and difficult problem to the 2-Maxsat problem, solve it in polynomial time, get rich and come back to argue if it is really a proof of P = NP.
Polynomial time can still be truly enormous