Fast generalized DFTs for all finite groups

01/08/2019

∙

by   Chris Umans, et al.

∙

0

∙

share

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.