Journal of Algorithms

Paper

01 Jan 1983

Minimal algorithms for bilinear forms may have divisions

View publication

Abstract

We present a minimal algorithm for computing a set of bilinear forms which uses divisions. © 1983.

Related

Paper

On the Multiplicative Complexity of Discrete Cosine Transforms

Ephraim Feig, Shmuel Winograd

IEEE Trans. Inf. Theory

Paper

Narrowband chemical-shift imaging

Ephraim Feig, Fred Greenleaf

Applied Optics

Paper

Implementation of Efficient Fft Algorithms on Fused Multiply-Add Architectures

Elliot N. Linzer, Ephraim Feig

IEEE TSP

Paper

Hadamard Transforms on Multiply/Add Architectures

Don Coppersmith, Ephraim Feig, et al.

IEEE TSP

View all publications