The multiplicative complexity of discrete cosine transforms

Ephraim Feig; Elliot Linzer

doi:10.1016/0196-8858(92)90023-P

Advances in Applied Mathematics

Paper

01 Jan 1992

The multiplicative complexity of discrete cosine transforms

View publication

Abstract

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.

Paper

New omega results in a weighted divisor problem

James Lee Hafner

Journal of Number Theory

Paper

Joint spectral radius and path-complete graph Lyapunov functions

Amir Ali Ahmadi, Raphaël M. Jungers, et al.

SICON

Paper

A minimal descriptor of an ancestral recombinations graph

Laxmi Parida, Pier F. Palamara, et al.

BMC Bioinformatics

Paper

A Formal Treatment of Non-repudiation Protocols

Satoshi Hada

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

View all publications

Abstract

Related

New omega results in a weighted divisor problem

Joint spectral radius and path-complete graph Lyapunov functions

A minimal descriptor of an ancestral recombinations graph

A Formal Treatment of Non-repudiation Protocols