Barseghyan, R. V. . (2021) “About Complexity of FFT Algorithms for Length of q × 2p”, Mathematical Problems of Computer Science, 48, pp. 23–32. Available at: http://www.mpcs.sci.am/index.php/mpcs/article/view/117 (Accessed: 2May2025).