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

@@ 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