… 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.
Popularity: 5% [?]
(No Ratings Yet)
Loading ...
October 11th, 2007 at 3:34 pm
grabe you are a genius inday!^_^
November 16th, 2007 at 2:19 pm
WAAAAAAAH!!! GRABE NA NOSEBLEED KO! BUMABAHA NA DITO SA BAHAAAAY!!!
December 24th, 2007 at 6:50 am
an einstein in our midst? hwahahahaa!! the student’s intellect pales in comparison. hwahahahaha!
March 24th, 2008 at 12:13 am
maybe sampung beses kang nagmasteral ng english inday!
sobrang galing!
pwede mo nang kalabanin ang mga amerikano inday!
ipagtanggol mo ang mga pilipino!
June 1st, 2008 at 12:04 am
malufet ka pa ata kay einstein eh..