Existence and efficient construction of fast Fourier transforms on supersolvable groups (Q685713): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper complexity bounds for the discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the general discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Harmonic Analysis of Polynomial Threshold Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier Transforms for Metabelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast generalized Fourier transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Machine Calculation of Complex Fourier Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5340151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of spectral analysis with application to ranked data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitive Idempotents in Group Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3223036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3668806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a soluble quotient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Fourier analysis for abelian group extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4126536 / rank
 
Normal rank

Latest revision as of 09:56, 22 May 2024

scientific article
Language Label Description Also known as
English
Existence and efficient construction of fast Fourier transforms on supersolvable groups
scientific article

    Statements

    Existence and efficient construction of fast Fourier transforms on supersolvable groups (English)
    0 references
    0 references
    10 October 1993
    0 references
    fast Fourier transforms
    0 references
    monomial representations
    0 references
    linear complexity
    0 references
    supersolvable group
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references