On the multiplicative complexity of the discrete Fourier transform (Q1259162): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56048274, #quickstatements; #temporary_batch_1704783578975 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:24, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the multiplicative complexity of the discrete Fourier transform |
scientific article |
Statements
On the multiplicative complexity of the discrete Fourier transform (English)
0 references
1979
0 references
Algebraic Complexity
0 references
Multiplicative Complexity
0 references
Polynomial Multiplication
0 references
Discrete Fourier Tansform
0 references
Chinese Remainder Theorem
0 references
