{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:39:43Z","timestamp":1776685183834,"version":"3.51.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf01200062","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:07:51Z","timestamp":1108728471000},"page":"235-256","source":"Crossref","is-referenced-by-count":18,"title":["Existence and efficient construction of fast Fourier transforms on supersolvable groups"],"prefix":"10.1007","volume":"1","author":[{"given":"Ulrich","family":"Baum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"M.D. Atkinson (ed.),Computational Group Theory, Academic Press, 1984."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"L. Babai, L. R\u00f3nyai, Computing Irreducible Representations of Finite Groups,Proc. 30th IEEE Symp. Foundations of Comput. Science, 1989, 93?98.","DOI":"10.1109\/SFCS.1989.63461"},{"key":"CR3","unstructured":"U. Baum,Existenz und effiziente Konstruktion schneller Fouriertransformationen \u00fcberaufl\u00f6sbarer Gruppen, Dissertation, Universit\u00e4t Bonn, 1991."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1137\/0220028","volume":"2","author":"U. Baum","year":"1991","unstructured":"U. Baum, M. Clausen, Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and Their Inverses,SIAM J. Comput.,2 (1991), 451?459.","journal-title":"SIAM J. Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF01810853","volume":"2","author":"U. Baum","year":"1991","unstructured":"U. Baum, M. Clausen, B. Tietz, Improved Upper Complexity Bounds for the Discrete Fourier Transform,AAECC,2 (1991), 35?43.","journal-title":"AAECC"},{"key":"CR6","unstructured":"T. Beth,Verfahren der schnellen Fourier-Transformation, Teubner, 1984."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(87)90041-7","volume":"51","author":"T. Beth","year":"1987","unstructured":"T. Beth, On the Computational Complexity of the General Discrete Fourier Transform,Theor. Comp. Sci.,51 (1987), 331?339.","journal-title":"Theor. Comp. Sci."},{"key":"CR8","first-page":"451","volume":"18","author":"L.I. Bluestein","year":"1970","unstructured":"L.I. Bluestein, A Linear Filtering Approach to the Computation of the Discrete Fourier Transform,IEEE Trans.,AU 18 (1970), 451?455.","journal-title":"IEEE Trans., AU"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/0403015","volume":"3","author":"J. Bruck","year":"1990","unstructured":"J. Bruck, Harmonic Analysis of Polynomial Threshold Functions,SIAM J. Disc. Math.,3 (1990), 168?177.","journal-title":"SIAM J. Disc. Math."},{"key":"CR10","volume-title":"Introduction to Computational Group Theory","author":"G. Butler","year":"1989","unstructured":"G. Butler, J. Cannon,Introduction to Computational Group Theory, Computers & Mathematics, Tutorial Minicourse Notes, MIT, Cambridge, MA, 1989."},{"key":"CR11","unstructured":"J. Cannon, An Introduction to the Group Theory Language CAYLEY, in: [1] 145?183."},{"key":"CR12","unstructured":"M. Clausen,Beitr\u00e4ge zum Entwurf schneller Spektraltransformationen, Habilitationsschrift, Universit\u00e4t Karlsruhe, 1988."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1137\/0218040","volume":"18","author":"M. Clausen","year":"1989","unstructured":"M. Clausen, Fast Fourier Transforms for Metabelian Groups,SIAM J. Comput.,18 (1989), 584?593.","journal-title":"SIAM J. Comput."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0304-3975(89)90021-2","volume":"67","author":"M. Clausen","year":"1989","unstructured":"M. Clausen, Fast Generalized Fourier Transforms,Theor. Comp. Sci.,67 (1989), 55?63.","journal-title":"Theor. Comp. Sci."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"J.W. Cooley, J.W., Tukey, An Algorithm for the Machine Calculation of Complex Fourier Series,Math. Comp.,19 (1965), 297?301.","journal-title":"Math. Comp."},{"key":"CR16","unstructured":"C.W. Curtis, I. Reiner,Representation Theory of Finite Groups and Associative Algebras, Wiley & Sons, 1962."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1214\/aos\/1176347251","volume":"17","author":"P. Diaconis","year":"1989","unstructured":"P. Diaconis, A Generalization of Spectral Analysis with Application to Ranked Data,Ann. Statistics,17 (1989), 949?979.","journal-title":"Ann. Statistics"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"P. Diaconis,Group Representations in Probability and Statistics, Institute of Mathematical Statistics Lecture Notes-Monograph Series,11, Hayward, CA, 1988.","DOI":"10.1214\/lnms\/1215467407"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"G. Havas, M.F. Newman, Calculating Presentations for Certain Kinds of Quotient Groups,Proc. Assoc. Comput. Mach. SYMSAC'76, 1976, 2?8.","DOI":"10.1145\/800205.806317"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"B. Huppert Endliche Gruppen I, Springer, 1967.","DOI":"10.1007\/978-3-642-64981-3"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"B. Huppert, N. Blackburn,Finite Groups II, Springer, 1982.","DOI":"10.1007\/978-3-642-67994-0"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"S.L. Hurst, D.M., Miller, J.C. Muzio,Spectral Techniques in Digital Logic, Academic Press, 1985.","DOI":"10.1016\/0165-1684(85)90052-0"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1090\/S0002-9939-1966-0194523-0","volume":"17","author":"G.J. Janusz","year":"1966","unstructured":"G.J. Janusz, Primitive Idempotents in Group Algebras,Proc. Am. Math. Soc.,17 (1966), 520?523.","journal-title":"Proc. Am. Math. Soc."},{"key":"CR24","unstructured":"M.G. Karpovsky (ed.),Spectral Techniques and Fault Detection, Academic Press, 1985."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0065-3276(08)60341-X","volume":"5","author":"D.J. Klein","year":"1970","unstructured":"D.J. Klein, C.H. Carlisle, F.A. Matsen, Symmetry Adaptation to Sequences of Finite Groups,Advances in Quantum Chemistry,5 (1970), Academic Press, 219?260.","journal-title":"Advances in Quantum Chemistry"},{"key":"CR26","unstructured":"C.R. Leedham-Green, A Soluble Group Algorithm, in: [1], 85?101."},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"N. Linial, Y. Mansour, N. Nisan, Constant Depth Circuits, Fourier Transform, and Learnability,Proc. 30th IEEE Symp. Foundations of Comput. Science, 1989, 574?579.","DOI":"10.1109\/SFCS.1989.63537"},{"key":"CR28","unstructured":"J.D. Lipson,Elements of Algebra and Algebraic Computing, Benjamin-Cummings, 1981."},{"issue":"2","key":"CR29","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1145\/321752.321761","volume":"20","author":"J. Morgenstern","year":"1973","unstructured":"J. Morgenstern, Note on a Lower Bound of the Linear Complexity of the Fast Fourier Transform,J. Assoc. Comput. Mach.,20\/2 (1973), 305?306.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR30","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1137\/0912016","volume":"12","author":"K. Murota","year":"1991","unstructured":"K. Murota, K. Ikeda, Computational Use of Group Theory in Bifurcation Analysis of Symmetric Structures,SIAM J. Sci. Stat. Comput.,12 (1991), 273?297.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"K. Niederdrenk,Die endliche Fourier- und Walsh-Transformation mit einer Einf\u00fchrung in die Bildverarbeitung, Vieweg, 1982.","DOI":"10.1007\/978-3-663-14178-5"},{"key":"CR32","unstructured":"R.A. Parker, The Computer Calculation of Modular Characters (The Meat-Axe), in: [1], 267?274."},{"key":"CR33","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0747-7171(87)80060-3","volume":"4","author":"W. Plesken","year":"1987","unstructured":"W. Plesken, Towards a Soluble Quotient Algorithm,J. Symbolic Computation,4 (1987), 111?122.","journal-title":"J. Symbolic Computation"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0196-8858(90)90008-M","volume":"11","author":"D. Rockmore","year":"1990","unstructured":"D. Rockmore, Fast Fourier Analysis for Abelian Group Extensions,Advances in Applied Math.,11 (1990), 164?204.","journal-title":"Advances in Applied Math."},{"key":"CR35","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage, V. Strassen, Schnelle Multiplikation gro\u00dfer Zahlen,Computing,7 (1971), 281?292.","journal-title":"Computing"},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"J.P. Serre,Linear Representations of Finite Groups, Springer, 1977.","DOI":"10.1007\/978-1-4684-9458-7"},{"key":"CR37","doi-asserted-by":"crossref","unstructured":"E.A. Trachtenberg, M.G. Karpovsky Filtering in a Communication Channel by Fourier Transforms over Finite Groups, in: [24], 179?216.","DOI":"10.1016\/B978-0-12-400060-5.50010-0"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200062\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:19:10Z","timestamp":1734956350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF01200062"],"URL":"https:\/\/doi.org\/10.1007\/bf01200062","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}