Turns out, Primes are in P
zorba1 writes "Manindra Agrawal et. al. of the Indian Institute of Technology Kanpur CS department have released a most interesting paper today. It presents an algorithm that determines whether a number is prime or not in polynomial time. While I haven't gone through the presentation in detail, it looks like a promising, albeit non-optimized, solution for the famous PRIMES in P problem."
Um, if you don't like nerdy stuff.. I hate to break it to you, but this might not be the place for you. :)
slashdot!=valid HTML
If I'm reading this correctly, we've got a nearly guaranteed winner of the Nobel Prize here.
Bah.... so what? I have developed an algorithm that will determine if any number less than a google is prime in O(1). Above a google it degrades pretty fast, though.
-a
How to rationalize theft.
Does the eating of asparagus affect the presence of primes in P?
Inquiring minds want to know!
But I set it to plain text! Shouldn't slashdot automatically replace my (less-than) symbol with < or whatever?
Since slashdot doesn't seem to be doing that I feel like the mode shouldn't be called "Plain Old Text".
Ah well. I'm just bitter because I screwed up twice in a row.