Timeline for Algorithms with polynomial time complexity of higher order
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 4, 2013 at 6:15 | comment | added | Raphael | @YuvalFilmus True, but that is probably the case for any algorithm with runtime in $\omega(n^3)$ in practice, and in some settings for all algorithms with runtime in $\Omega(n)$. | |
| Apr 4, 2013 at 1:31 | vote | accept | Deepu | ||
| Apr 3, 2013 at 21:18 | comment | added | Yuval Filmus | On the other hand, there is no reason to use AKS. You should use one of the probabilistic tests instead, with a probability of failure smaller than hardware failure. | |
| Apr 3, 2013 at 21:04 | history | answered | Raphael | CC BY-SA 3.0 |