The complexity of group algebra computations

DOI10.1016/0304-3975(77)90007-XMaRDI QIDQ1242989zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3212917 (Why is no real title available?)
• scientific article; zbMATH DE number 3338817 (Why is no real title available?)
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Gaussian elimination is not optimal
• On the Fast Fourier Transform on Finite Abelian Groups

Cited in

(8)

• Improved upper complexity bounds for the discrete Fourier transform
• Efficient computation of Fourier transforms on compact groups
• Fast generalized Fourier transforms
• Group-theoretic lower bounds for the complexity of matrix multiplication
• Efficient Computation of the Fourier Transform on Finite Groups
• On the computational complexity of the general discrete Fourier transform
• Generalizing the discrete Fourier transform
• Bounds on the ranks of some 3-tensors

This page was built for publication: The complexity of group algebra computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242989)