BARSEGHYAN, R. V. . About Complexity of FFT Algorithms for Length of q × 2p. Mathematical Problems of Computer Science, [S. l.], v. 48, p. 23–32, 2021. Disponível em: http://93.187.165.2/index.php/mpcs/article/view/117. Acesso em: 28 sep. 2024.