The Complexity of FFT and Related Butterfly Algorithms on Meshes and Hypermeshes.
Ted H. SzymanskiPublished in: ICPP (3) (1992)
Keyphrases
- computational complexity
- worst case
- computational cost
- fast fourier transform
- significant improvement
- optimization problems
- high computational complexity
- data structure
- space complexity
- recently developed
- times faster
- computationally efficient
- lower complexity
- orders of magnitude
- decision trees
- signal processing
- three dimensional
- data mining algorithms
- theoretical analysis
- multiresolution