Pages that link to "Item:Q1094136"

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

Displaying 9 items.

• Generating fast Fourier transforms of solvable groups (Q597054) (← 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)
• The efficient computation of Fourier transforms on semisimple algebras (Q1783700) (← links)
• Implementation of group-covariant positive operator valued measures by orthogonal measurements (Q3024169) (← links)
• Quantum algorithms for algebraic problems (Q3077033) (← links)
• Efficient Computation of the Fourier Transform on Finite Groups (Q3493168) (← links)