Why wouldn't it? 1) If P = NP and and the bounding polynomial is immensely huge, it would be somewhat disappointing, but interesting nonetheless. 2) if P = NP

Why wouldn't it? 1) If P = NP and and the bounding polynomial is immensely huge, it would be somewhat disappointing, but interesting nonetheless. 2) if P = NP and there is efficient algorithm, it would be amazing. There are problems harder that NP-complete problems. 3) P != NP, then nothing would change.