The following pages link to (Q3321411):
Displayed 17 items.
- Symmetry-based matrix factorization (Q597055) (← 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)
- Fast Fourier analysis for abelian group extensions (Q921894) (← links)
- Representation-theoretical properties of the approximate quantum Fourier transform (Q937218) (← links)
- Applications of the DFT to Abelian difference sets (Q1093642) (← links)
- On the computational complexity of the general discrete Fourier transform (Q1094136) (← links)
- Fast generalized Fourier transforms (Q1123578) (← links)
- The \(GF(p)\)-dimension of the codes generated by the classical point-line geometries over \(GF(p)\) (Q1261006) (← links)
- Testing the shift-equivalence of polynomials using quantum machines (Q1356318) (← links)
- Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
- Generalizing the discrete Fourier transform (Q1822477) (← links)
- Decomposing monomial representations of solvable groups. (Q1867001) (← links)
- Extensions of irreducible representations (Q1924550) (← links)
- Generalization of the algebraic discrete Fourier transform with application to fast convolutions (Q2277806) (← links)
- Efficient Computation of the Fourier Transform on Finite Groups (Q3493168) (← links)
- The efficient computation of Fourier transforms on the symmetric group (Q4396453) (← links)