Current Events > Potential proof showing that P != NP (major computer science problem)

Topic List
Page List: 1
luigi13579
08/17/17 4:27:26 PM
#1:


Norbert Blum claims that he has proven that P != NP.

https://lucatrevisan.wordpress.com/2017/08/15/on-norbert-blums-claimed-proof-that-p-does-not-equal-np/

The proof: https://arxiv.org/abs/1708.03486

stackexchange discussion: https://cstheory.stackexchange.com/questions/38803/is-norbert-blums-2017-proof-that-p-ne-np-correct/

I'm not totally up on what this would mean. From my understanding, there are certain applications of computer science that rely on the assumption that P != NP, such as modern cryptography algorithms. If the opposite were the case (i.e. P = NP), this would potentially allow these algorithms to be cracked (although there may be weaknesses in these algorithms anyway), which would have major implications for cyber security, so we can rest a bit easier in that regard.

More widely, I think it would mean that many common problems cannot be solved efficiently, so attention could be directed elsewhere.
... Copied to Clipboard!
Giant_Aspirin
08/17/17 4:29:29 PM
#2:


i graduated with a degree in CS&E and i have no idea wtf those guys are talking about in that discussion
---
Now Playing: Nier: Automata (PC)
(~);} - Get out the pans, don't just stand there dreamin' - {;(~)
... Copied to Clipboard!
luigi13579
08/17/17 4:36:58 PM
#3:


Giant_Aspirin posted...
i graduated with a degree in CS&E and i have no idea wtf those guys are talking about in that discussion

I get some parts, but there's no way I could follow the whole thing through step by step.

Like, the boolean algebra isn't too bad. I'm a bit rusty though, so I'd need to brush up on it.
... Copied to Clipboard!
Topic List
Page List: 1