>P vs NP solved Welp, there goes my career.

Not to worry, you would have never amounted to anything anyway.

>>9107709

Hey, fuck you.

>implying you ever stood a chance

>>9107697
Source?

>>9107717
https://arxiv.org/pdf/1708.03486.pdf

feels good to be an engineer lmao

>>9107717
Nothing to worry about. Over 100 "solutions" to P vs. NP already exist.
http://www.win.tue.nl/~gwoegi/P-versus-NP.htm

>>9107697
was the proof verified and confirmed ?

>>9107718
>https://arxiv.org/pdf/1708.03486.pdf
Already found a mistake on the 3rd page.

Pathetic.

>>9107728
1 rotten apple shouldn't spoil the bunch. Keep reading.

>>9107728
Point it out then, genius

>>9107728

Page 3 is literally just definitions...

>>9107718
>Berg and Ulfberg [4] and Amano and Maruoka [2] have used CNF DNF approximators to prove exponential lower bounds for the monotone network complexity of the clique function and of Andreev’s function.

What?

>>9107747

It's very heavily on strange definitions if you are not a computer scientist but it is actually easy to understand what the definitions mean.

Anyway, I'm not going to bother translating this shit. It's just a fucking per-print.

Chances are it's literally nothing

>>9107743
thats the joke

>>9107697
P=0 or N=1

>>9107905
Do you honestly think the solution to such a famous unsolved problem could be that simple?

>>9107914
Yes

>>9107917
someone get this guy the nobel peace prize!

>>9107917
How can you be so dense? Of course it's not a simple linear equation with two unknown variables, it's much deeper than that. Next time use you head before you post.

>>9107925
?? of course it is

>>9107925
Are you autistic, retarded or both?

>>9107905
What are you referring to as P, 0 and 1, and =?

>>9107996
P = NP

>>9107697
P may or may not equal NP

>>9107697
The Millennium Prize hasn't been claimed yet so I assume there's still some work left to do.

>>9107697
>not even waiting until proof is actually accepted
You obviously won't solve it anyways

>>9107718
As I recall there was an EE that posted an incorrect solution to the RH as well.

What is the significants of P!=NP?

>>9108269
I will assume you're mathematically ignorant regarding the topic and give broad generalizations

P=NP means the answer is just as easy to discover as to verify. Implying:
>Prime factoring based cryptography is broken
>Recognition of genius is not order of magnitude easier than being genius

P!=NP means the opposite, that things are as they seem

Here's a nice video explaining the P = NP problem

https://www.youtube.com/watch?v=YX40hbAHx3s

>>9108385
>>Recognition of genius is not order of magnitude easier than being genius