ON THE COMPUTATIONAL-COMPLEXITY OF THE GENERAL DISCRETE FOURIER-TRANSFORM

[1] Atkinson M. D., 1977, Theoretical Computer Science, V5, P205, DOI 10.1016/0304-3975(77)90007-X

[2] BETH T, 1985, LECT NOTES COMPUT SC, V203, P93

[3] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &

[4] COPPERSMITH D, 1986, UNPUB MATRIX MULTIPL

[5] Curtis C.W., 1990, METHODS REPRESENTATI, VI

[6] DORNHOFF L, 1971, GROUP REPRESENTATI A

[7] GRIESS RL, 1980, P SYMP PURE MATH, V37, P279

[8] Huppert, 1967, ENDLICHE GRUPPEN, DOI 10.1007/978-3-642-64981-3

[9] Isaacs I.M, 1976, CHARACTER THEORY FIN, V69

[10] KARPOVSKY MG, 1977, IEEE T COMPUT, V26, P1028, DOI 10.1109/TC.1977.1674739

[1] Atkinson M. D., 1977, Theoretical Computer Science, V5, P205, DOI 10.1016/0304-3975(77)90007-X

[2] BETH T, 1985, LECT NOTES COMPUT SC, V203, P93

[3] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &

[4] COPPERSMITH D, 1986, UNPUB MATRIX MULTIPL

[5] Curtis C.W., 1990, METHODS REPRESENTATI, VI

[6] DORNHOFF L, 1971, GROUP REPRESENTATI A

[7] GRIESS RL, 1980, P SYMP PURE MATH, V37, P279

[8] Huppert, 1967, ENDLICHE GRUPPEN, DOI 10.1007/978-3-642-64981-3

[9] Isaacs I.M, 1976, CHARACTER THEORY FIN, V69

[10] KARPOVSKY MG, 1977, IEEE T COMPUT, V26, P1028, DOI 10.1109/TC.1977.1674739