Tutor

… A fundamental question of longstanding theoretical interest is to prove lower bounds on the complexity and exact operation counts of Fast Fourier transforms, and many open problems remain. It is not even rigorously proved whether DFTs truly require Ω(NlogN) (i.e., order NlogN or greater) operations, even for the simple case of power of two sizes, although no algorithms with lower complexity are known….

- tinu-tutor ni Inday sa digital signal processing ang kapatid ng kanyang amo na si Mark na nagmamasters sa LaSalle.