The complexity of group algebra computations

DOI10.1016/0304-3975(77)90007-XzbMath0368.20005OpenAlexW1967762078MaRDI QIDQ1242989

K. Appert

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(77)90007-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Group rings (16S34) Group rings of finite groups and their modules (group-theoretic aspects) (20C05)

Related Items

On the computational complexity of the general discrete Fourier transform, Fast generalized Fourier transforms, Bounds on the ranks of some 3-tensors, Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication, Efficient Computation of the Fourier Transform on Finite Groups, Efficient computation of Fourier transforms on compact groups, Generalizing the discrete Fourier transform, Improved upper complexity bounds for the discrete Fourier transform

Cites Work

• Unnamed Item
• Unnamed Item
• Gaussian elimination is not optimal
• An Algorithm for the Machine Calculation of Complex Fourier Series
• On the Fast Fourier Transform on Finite Abelian Groups