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

Modified ffts for fused multiply-add architectures

Elliot Linzer, Ephraim Feig

Mathematics of Computation

Paper

Fast Algorithms for the Discrete Cosine Transform

Ephraim Feig, Shmuel Winograd

IEEE TSP

Paper

Hadamard Transforms on Multiply/Add Architectures

Don Coppersmith, Ephraim Feig, et al.

IEEE TSP

Paper

On the direct sum conjecture

Ephraim Feig, Shmuel Winograd

Linear Algebra and Its Applications

View all publications