Author:
Clausen Michael,Müller Meinard
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Baum, U.: Existence and efficient construction of fast Fourier transforms for super solvable groups. Computational Complexity, 1 (1991), 235–256.
2. Baum, U., Clausen, M.: Some lower and upper complexity bounds for generalized Fourier transforms and their inverses. SIAM J. Comput., 20 (1991), 451–459.
3. Baum, U., Clausen, M.: Computing irreducible representations of super solvable groups. Mathematics of Computation, Volume 63, Number 207 (1994) 351–359.
4. Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften, Volume 315, Springer Verlag, Berlin, 1997.
5. Clausen, M., Baum, U.: Fast Fourier Transforms. BI-Wissenschaftsverlag, Mannheim, 1993.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DFT-based Word Normalization in Finite Supersolvable Groups;Applicable Algebra in Engineering, Communication and Computing;2004-09-06