P = NP [pdf]

A note -- when linking to arXiv, please link to the abstract[1], not directly to the PDF. The abstract has other information about the paper, and one can see different versions of the paper, and of course one can click through to the actual paper. Going the other way requires manually editing the URL.<p>[1]<a href="http://arxiv.org/abs/1208.0954" rel="nofollow">http:&#x2F;&#x2F;arxiv.org&#x2F;abs&#x2F;1208.0954</a>

This is from August of 2012. If there were actually a proof of P = NP posted on the arXiv, wouldn&#x27;t we have heard about it by now?

The TV show Elementary did an episode in which someone solved N = NP and then used the solution to break any encryption they wanted. It all seemed a little far fetched to me.

Extensive discussion a few hours ago<p><a href="https://news.ycombinator.com/item?id=6846228" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=6846228</a>

There are many proofs, you can find some of them here:<p><a href="http://www.win.tue.nl/~gwoegi/P-versus-NP.htm" rel="nofollow">http:&#x2F;&#x2F;www.win.tue.nl&#x2F;~gwoegi&#x2F;P-versus-NP.htm</a><p>Like all famous problems, P vs NP attracts a great number of people, mostly amateurs, that want to try to solve it. Most of those proofs are not peer reviewed, all of them are probably wrong.

Well I for one freely admit I can&#x27;t understand a word of it. But I do appreciate the implications if it&#x27;s true, and look forward to more readable analysis by others more qualified than myself!