Existence and efficient construction of fast Fourier transforms on supersolvable groups
type: Item
instance of: scholarly article
title: Existence and efficient construction of fast Fourier transforms on supersolvable groups
zbMATH Open document ID: 0778.65092
DOI: 10.1007/BF01200062
author: Ulrich Baum
published in: Computational Complexity
publication date: 1993-10-10T00:00:00Z
Mathematics Subject Classification ID: 65T50
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 20C15
Mathematics Subject Classification ID: 20C40
zbMATH DE Number: 423596
zbMATH Keywords: fast Fourier transforms
zbMATH Keywords: monomial representations
zbMATH Keywords: linear complexity
zbMATH Keywords: supersolvable group
describes a project that uses: Cayley
MaRDI profile type: Publication
cites work: Q3320288
cites work: Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
cites work: Improved upper complexity bounds for the discrete Fourier transform
cites work: Q3321411
cites work: On the computational complexity of the general discrete Fourier transform
cites work: Harmonic Analysis of Polynomial Threshold Functions
cites work: Fast Fourier Transforms for Metabelian Groups
cites work: Fast generalized Fourier transforms
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: Q5340151
cites work: A generalization of spectral analysis with application to ranked data
cites work: Q3995195
cites work: Q3903159
cites work: Q3934684
cites work: Q3765707
cites work: Primitive Idempotents in Group Algebras
cites work: Q3026944
cites work: Q3223036
cites work: Constant depth circuits, Fourier transform, and learnability
cites work: Q3919787
cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
cites work: Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures
cites work: Q3668806
cites work: Q3218280
cites work: Towards a soluble quotient algorithm
cites work: Fast Fourier analysis for abelian group extensions
cites work: Fast multiplication of large numbers
cites work: Q4126536
description: scientific article; zbMATH DE number 423596