Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Beth:1987:CCG,
author = "T. Beth",
title = "On the computational complexity of the general
discrete {Fourier} transform",
journal = j-THEOR-COMP-SCI,
volume = "51",
number = "3",
pages = "331--339",
month = "????",
year = "1987",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1130 (Integral transforms); C4240 (Programming and
algorithm theory)",
corpsource = "Fak. fur Inf., Karlsruhe Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; finite groups; Fourier
transforms; general discrete Fourier transform; group
algebras",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}