Anonymous user
Talk:AKS test for primes: Difference between revisions
→This isn't AKS: Tell numberphile please.
(→This isn't AKS: new section) |
(→This isn't AKS: Tell numberphile please.) |
||
Line 29:
An aside, I'm a bit confused by their talk, especially at the end, that "this is a fast test". It's ''ridiculously'' slow. Nobody uses this test in practice. It's very important in the theory, as it is deterministically polynomial time. But the constants are horrendously large. See, for example, [http://maths-people.anu.edu.au/~brent/pd/UMS10t4.pdf Brent 2010] "AKS is not a practical algorithm. ECPP is much faster." This includes run times of hundreds of years for numbers that ECPP does in a few seconds.
:Hi, er, Danaj (please sign your talk page contributions using <nowiki>--~~~~</nowiki>).
:I guess this is the AKS test according to numberphile at the moment. It was the easy suitability of the explanation in forming an RC task that made me create it; I only added the other link afterwards. If you get numberphile to retract then I would be glad to change the task name. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 06:53, 21 February 2014 (UTC)
| |||