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.

Workshop paper

Tensor graph neural networks for learning on time varying graphs

Conference paper

Enhancing Counterfactual Classification Performance via Self-Training

Conference paper

Projection techniques to update the truncated SVD of evolving matrices with applications

Conference paper

Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning

View all publications

Abstract

Related

Tensor graph neural networks for learning on time varying graphs

Enhancing Counterfactual Classification Performance via Self-Training

Projection techniques to update the truncated SVD of evolving matrices with applications

Taming Communication and Sample Complexities in Decentralized Policy Evaluation for Cooperative Multi-Agent Reinforcement Learning