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://93.187.165.2/index.php/mpcs/article/view/117 (Accessed: 28September2024).