Pages that link to "Item:Q1094136"

The following pages link to On the computational complexity of the general discrete Fourier transform (Q1094136):

Displaying 21 items.

• Generating fast Fourier transforms of solvable groups (Q597054) (← links)
• On computation of certain discrete Fourier transforms using binary calculus (Q674150) (← links)
• Existence and efficient construction of fast Fourier transforms on supersolvable groups (Q685713) (← links)
• Improved upper complexity bounds for the discrete Fourier transform (Q811112) (← links)
• Representation-theoretical properties of the approximate quantum Fourier transform (Q937218) (← links)
• Fast generalized Fourier transforms (Q1123578) (← links)
• On the real complexity of a complex DFT (Q1752320) (← links)
• A generalized FFT for Clifford algebras (Q1774318) (← links)
• The efficient computation of Fourier transforms on semisimple algebras (Q1783700) (← links)
• Generalizing the discrete Fourier transform (Q1822477) (← links)
• Implementation of group-covariant positive operator valued measures by orthogonal measurements (Q3024169) (← links)
• Quantum algorithms for algebraic problems (Q3077033) (← links)
• Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses (Q3355210) (← links)
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms (Q3482811) (← links)
• Efficient Computation of the Fourier Transform on Finite Groups (Q3493168) (← links)
• On the multiplicative complexity of discrete cosine transforms (Q4014159) (← links)
• (Q4040743) (← links)
• Energy Packing Efficiency for the Generalized Discrete Transforms (Q4166681) (← links)
• Comments on "Method of flow graph simplification for the 16-point discrete Fourier Transform" (Q4587772) (← links)
• (Q4864906) (← links)
• (Q5753440) (← links)