On the multiplicative complexity of the discrete Fourier transform
type: Item
instance of: scholarly article
title: On the multiplicative complexity of the discrete Fourier transform
zbMATH Open document ID: 0409.68019
DOI: 10.1016/0001-8708(79)90037-9
published in: Advances in Mathematics
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65T40
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 3637276
zbMATH Keywords: Algebraic Complexity
zbMATH Keywords: Multiplicative Complexity
zbMATH Keywords: Polynomial Multiplication
zbMATH Keywords: Discrete Fourier Tansform
zbMATH Keywords: Chinese Remainder Theorem
Wikidata QID: Q56048274
author: Shmuel Winograd
MaRDI profile type: Publication
full work available at URL: 0001-8708(79)90037-9
OpenAlex ID: W2078104849
cites work: Some bilinear forms whose multiplicative complexity depends on the field of constants
cites work: Algebras Having Linear Multiplicative Complexities
cites work: On Computing the Discrete Fourier Transform
cites work: An Algorithm for the Machine Calculation of Complex Fourier Series
cites work: On the number of multiplications necessary to compute certain functions
cites work: Q5674406
cites work: Q3272860
cites work: On Multiplication of Polynomials Modulo a Polynomial
description: scientific article; zbMATH DE number 3637276