Fast generalized DFTs for all finite groups
From MaRDI portal
Cites work
- A fast generalized DFT for finite groups of Lie type
- A Fourier space algorithm for solving quadratic assignment problems
- A new algorithm for fast generalized DFTs
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Character theory of finite groups
- Computing Irreducible Representations of Finite Groups
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- Fast Fourier transforms for wreath products
- Fast generalized Fourier transforms
- scientific article; zbMATH DE number 3852384 (Why is no real title available?)
- scientific article; zbMATH DE number 46141 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 610966 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1004938 (Why is no real title available?)
- scientific article; zbMATH DE number 1004944 (Why is no real title available?)
- On large subgroups of finite groups
- Separation of variables and the computation of Fourier transforms on finite groups, I
- Separation of variables and the computation of Fourier transforms on finite groups. II
- The efficient computation of Fourier transforms on semisimple algebras
- The efficient computation of Fourier transforms on the symmetric group
This page was built for publication: Fast generalized DFTs for all finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930368)