Even though most computer scientists already think P != NP, it's pretty crazy to finally put this problem to rest. If the paper is as well-written as it is, I have a feeling the peer review process is going to take a loooong time so we won't be seeing results anytime soon.
On splitting places of degree one in extensions of algebraic function fields, towers of function fields meeting asymptotic bounds, and basis constructions for algebraic-geometric codes.
Um... what exactly is P? And NP? And why do they not equal one another? Am why was that article so hard to read I stopped reading in the first paragraph? (oh, and the meaning of life would be good as well :))
http://rjlipton.wordpress.com/2010/08/08/a-proof-that-p-is-not-equal-to-np/
Even though most computer scientists already think P != NP, it's pretty crazy to finally put this problem to rest. If the paper is as well-written as it is, I have a feeling the peer review process is going to take a loooong time so we won't be seeing results anytime soon.
Let's hope that's a real proof!
My Head just exploded
Isn't that a map name? :)
Um... what exactly is P? And NP? And why do they not equal one another? Am why was that article so hard to read I stopped reading in the first paragraph? (oh, and the meaning of life would be good as well :))
I can finally sleep at night.