>P vs NP solved
Welp, there goes my career.
P vs NP solved
Charles Harris
Other urls found in this thread:
arxiv.org
win.tue.nl
youtube.com
twitter.com
Justin Gonzalez
Not to worry, you would have never amounted to anything anyway.
Jace Gray
Hey, fuck you.
Christopher Rodriguez
>implying you ever stood a chance
Nathan Price
Source?
Joshua Adams
feels good to be an engineer lmao
Jace Ward
Nothing to worry about. Over 100 "solutions" to P vs. NP already exist.
win.tue.nl
Joshua Diaz
was the proof verified and confirmed ?
Benjamin Jenkins
>arxiv.org
Already found a mistake on the 3rd page.
Pathetic.
Matthew Brooks
1 rotten apple shouldn't spoil the bunch. Keep reading.
Jaxon Powell
Point it out then, genius
Brayden Roberts
Page 3 is literally just definitions...
Eli Ortiz
>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?
Leo Stewart
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
Landon Adams
thats the joke
Wyatt Smith
P=0 or N=1
Juan Myers
Do you honestly think the solution to such a famous unsolved problem could be that simple?
Jace Flores
Yes
Lincoln Anderson
someone get this guy the nobel peace prize!
Jaxson Rodriguez
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.
Henry Bailey
?? of course it is
Kevin Cook
Are you autistic, retarded or both?
Austin Hall
What are you referring to as P, 0 and 1, and =?
Cooper Morris
P = NP
Levi Kelly
P may or may not equal NP
Henry Barnes
The Millennium Prize hasn't been claimed yet so I assume there's still some work left to do.
James Torres
>not even waiting until proof is actually accepted
You obviously won't solve it anyways
Ethan Campbell
As I recall there was an EE that posted an incorrect solution to the RH as well.
Bentley Carter
What is the significants of P!=NP?
Michael Campbell
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
Juan Foster
Here's a nice video explaining the P = NP problem
Brody Sanchez
>>Recognition of genius is not order of magnitude easier than being genius