Viewing a single comment thread. View all comments

carlthome t1_irhwo6z wrote

FFT is already O(n*log(n)) though so what could be improved? Linear time?

4

_Ruffy_ t1_iri6u60 wrote

I'd say the multiplicative factors left out in the O-notation actually matter in practice..

20

jpopham91 t1_irmwio4 wrote

Isn't what people thought about matrix multiplication before Strassen's algorithm too?

1