Frobenius Additive Fast Fourier Transform

DOI10.1145/3208976.3208998zbMath1460.65170arXiv1802.03932OpenAlexW2964028050MaRDI QIDQ5120205

Chen-Mou Cheng, Po-Chun Kuo, Ming-Shing Chen, Wending Li, Bo-Yin Yang

Publication date: 9 September 2020

Published in: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.03932

zbMATH Keywords

fast Fourier transformfinite fieldcomplexity boundFrobenius automorphismpolynomial multiplicationadditive FFTFrobenius additive FFTFrobenius FFT

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Numerical methods for discrete and fast Fourier transforms (65T50) Computational methods for problems pertaining to field theory (12-08)

Related Items (2)

Fast transforms over finite fields of characteristic two ⋮ Unnamed Item

This page was built for publication: Frobenius Additive Fast Fourier Transform