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

Representation of the fermionic boundary operator

Paper

Complex-time shredded propagator method for large-scale GW calculations

Workshop paper

Knowledge-augmented Risk Assessment (KaRA): a hybrid-intelligence framework for supporting knowledge-intensive risk assessment of prospect candidate

Conference paper

Cumulative Stay-time Representation for Electronic Health Records in Medical Event Time Prediction

View all publications

Abstract

Related

Representation of the fermionic boundary operator

Complex-time shredded propagator method for large-scale GW calculations

Knowledge-augmented Risk Assessment (KaRA): a hybrid-intelligence framework for supporting knowledge-intensive risk assessment of prospect candidate

Cumulative Stay-time Representation for Electronic Health Records in Medical Event Time Prediction