Five-step FFT algorithm with reduced computational complexity
From MaRDI portal
Publication:845949
DOI10.1016/j.ipl.2006.10.009zbMath1184.68267MaRDI QIDQ845949
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.10.009
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Uses Software
Cites Work