from the cats-and-dogs-living-together dept.
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."
"Well, it don't make the sun shine, but at least it don't deepen the shit."
-- Straiter Empy, in _Riddley_Walker_ by Russell Hoban