2 ms·
> So you don't actually know how to do it, but assume that you can. This a little strange. Not all that strange. I trust the members of the Algorithms Resear
by mac01021 10y ago
> So you don't actually know how to do it, but assume that you can. This a little strange.
Not all that strange. I trust the members of the Algorithms Research community when they tell me it's possible to test a number for primality in polynomial time. I have no idea how to do it.
- _asummers 10y agoAKS is the name of that algorithm, by the way, after the initials of the authors. The paper is called "PRIMES in P". https://en.wikipedia.org/wiki/AKS_primality_test https://en.wikipedia.org/wiki/AKS_primality_test