How is the complexity of applying Short term fourier transform over n samples with a moving window of size m amount to O(nmlogm)
evidently the author is performing an FFT $n$ times (or, if the window hop is not 1 sample, it would be proportional to $n$) and each FFT costs something proportional to $m \log(m)$).  all this is quite normal.