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

Motion optimization of ordered blocks for overlapped block motion compensation

Rajesh Rajagopalan, Ephraim Feig, et al.

IEEE TCSVT

Paper

On the Multiplicative Complexity of Discrete Cosine Transforms

Ephraim Feig, Shmuel Winograd

IEEE Trans. Inf. Theory

Paper

Scaled DCT's on Input Sizes that Are Composite

Ephraim Feig, Elliot Linzer

IEEE TSP

Paper

On the direct sum conjecture

Ephraim Feig, Shmuel Winograd

Linear Algebra and Its Applications

View all publications