Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field (Q5103032)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field |
scientific article; zbMATH DE number 7591072
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field |
scientific article; zbMATH DE number 7591072 |
Statements
Duhamel/Hollmann-Like Discrete Fourier Transform Algorithm With the Smallest Multiplicative Complexity Over a Finite Field (English)
0 references
23 September 2022
0 references
