Yes, P = NP would definitely have much bigger repercussions, but I imagine P != NP would be at least an assurance to anyone working in an area such a cryptography or security where the assumption is made there is no solution in polynomial time. But, yeah, P != NP is probably much more of a big deal in theoretical computer science than practical.
|