arXiv
Open Access
2019
Fast generalized DFTs for all finite groups
Chris Umans
Abstrak
For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{ω/2 + ε})$ operations, for any $ε> 0$. Here, $ω$ is the exponent of matrix multiplication.
Penulis (1)
C
Chris Umans
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2019
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓