4 ms·
"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 ba
by marcodiego 3y ago
"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_crmdgeon 3y agoPolynomial time can still be truly enormous