Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > MULTIPLICATION CODES:
Reports tagged with multiplication codes:
TR08-102 | 9th November 2008

#### Finding Significant Fourier Transform Coefficients Deterministically and Locally

Computing the Fourier transform is a basic building block used in numerous applications. For data intensive applications, even the $O(N\log N)$ running time of the Fast Fourier Transform (FFT) algorithm may be too slow, and {\em sub-linear} running time is necessary. Clearly, outputting the entire Fourier transform in sub-linear ... more >>>

TR20-179 | 2nd December 2020