Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
We obtain the multiplicative complexity of discrete cosine transforms in all cases. It is given as a function of the multiplicative complexity of discrete Fourier transforms. The latter have all been determined previously. © 1992.
Richard M. Karp, Raymond E. Miller
Journal of Computer and System Sciences
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002