Pages that link to "Item:Q1259162"

The following pages link to On the multiplicative complexity of the discrete Fourier transform (Q1259162):

Displaying 10 items.

• The multiplicative complexity of certain semilinear systems defined by polynomials (Q786509) (← links)
• The construction of orthonormal bases diagonalizing the discrete Fourier transform (Q795492) (← links)
• Ring structure and the Fourier transform (Q1059676) (← links)
• The multiplicative complexity of the discrete Fourier transform (Q1060552) (← links)
• The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms (Q1069699) (← links)
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u]/<Q(u)^{\ell}>\), \(\ell >1\) (Q1110328) (← links)
• Direct sums of bilinear algorithms (Q1157377) (← links)
• Size bounds for superconcentrators (Q1170885) (← links)
• On the real complexity of a complex DFT (Q1752320) (← links)
• The multiplicative complexity of discrete cosine transforms (Q1802353) (← links)