Possible Proof of P != NP
I’m not sure that this one will break into the public consciousness, but Vinay Deolalikar of HP may have proved one of the major challenges in complexity theory, that P != NP. In addition to being a great intellectual success, this particular problem has very big practical implications. Luckily, though …
more ...