The multiplicative complexity of the discrete Fourier transform (Q1060552): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Louis Auslander / rank
 
Normal rank
Property / author
 
Property / author: Ephraim Feig / rank
 
Normal rank
Property / author
 
Property / author: Shmuel Winograd / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0196-8858(84)90005-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060231433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiplicative complexity of certain semilinear systems defined by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abelian semi-simple algebras and algorithms for the discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiplicative complexity of the discrete Fourier transform / rank
 
Normal rank

Latest revision as of 17:14, 14 June 2024

scientific article
Language Label Description Also known as
English
The multiplicative complexity of the discrete Fourier transform
scientific article

    Statements

    The multiplicative complexity of the discrete Fourier transform (English)
    0 references
    1984
    0 references
    We show how to compute the multiplicative complexity of the discrete Fourier transform on any set of data points.
    0 references
    minimal algorithms
    0 references
    multiplicative complexity
    0 references
    discrete Fourier transform
    0 references
    0 references
    0 references
    0 references

    Identifiers

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