On the multiplicative complexity of the discrete Fourier transform (Q1259162): Difference between revisions

@@ Property / author @@
-Shmuel Winograd
@@ Property / author: Shmuel Winograd / rank @@
-Normal rank
@@ Property / author @@
+Shmuel Winograd
@@ Property / author: Shmuel Winograd / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0001-8708(79)90037-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2078104849
@@ Property / OpenAlex ID: W2078104849 / rank @@
+Normal rank
@@ Property / cites work @@
+Some bilinear forms whose multiplicative complexity depends on the field of constants
+Normal rank
@@ Property / cites work @@
+Algebras Having Linear Multiplicative Complexities
+Normal rank
@@ Property / cites work @@
+On Computing the Discrete Fourier Transform
@@ Property / cites work: On Computing the Discrete Fourier Transform / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for the Machine Calculation of Complex Fourier Series
+Normal rank
@@ Property / cites work @@
+On the number of multiplications necessary to compute certain functions
+Normal rank
@@ Property / cites work @@
+Q5674406
@@ Property / cites work: Q5674406 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3272860
@@ Property / cites work: Q3272860 / rank @@
+Normal rank
@@ Property / cites work @@
+On Multiplication of Polynomials Modulo a Polynomial
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1259162