Re:A prime number whose binary representation looks like a g...
by YomiK on Monday January 22, 2018 @02:20PM
(#16207077)
"not as slow as pre-AKS methods." only in terms of provable asymptotic bounds. It's much slower than APR-CL and ECPP, both of which existed before AKS, and are the methods used daily.
[ Parent
| on HN ]
There are no comments on this comment yet.