Timeline for What is the reason that is FFT multiplication slower than other methods for small N?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 11, 2014 at 4:09 | vote | accept | hatch22 | ||
| May 9, 2014 at 20:40 | answer | added | Wandering Logic | timeline score: 3 | |
| May 9, 2014 at 15:49 | history | tweeted | twitter.com/#!/StackCompSci/status/464794366658088961 | ||
| May 9, 2014 at 14:45 | comment | added | Juho | This is relevant to other algorithms as well: an algorithm with a "bad" asymtotic runtime can be much faster than a fancier and theoretically faster algorithm on small inputs. For example, insertion sort can be a much better choice for small arrays than quicksort. | |
| May 9, 2014 at 14:37 | history | asked | hatch22 | CC BY-SA 3.0 |