3 ms·
for me the most exciting would be "here's a constructive proof that P=NP. It uses polynomials of degree one million".
by enriquto 7y ago
for me the most exciting would be "here's a constructive proof that P=NP. It uses polynomials of degree one million".
- chx 7y agoWhile Knuth has a different take on the P=?NP problem than most others, namely he believes P=NP, nonetheless, he is also saying that the degree won't ever be known and not even an upper bound will be known for it. http://www.informit.com/articles/article.aspx?p=2213858&WT.mc_id=Author_Knuth_20Questions http://www.informit.com/articles/article.aspx?p=2213858&WT.m... Certainly "if P=NP it'll be a pure non-constructive proof with no practical consequence whatsoever" feels right.