A SHORT PROOF THAT NP IS NOT P
В. В. Иванов · International Journal of Pure and Apllied Mathematics · 2014
This proof of N P = P is based on better estimates of lower bounds on the time complexity that hold for all solution algorithms.Almost no special knowledge other than logical and combinatorial efforts is needed to understand the proof.