Skip to main content
Research
Focus areas
Blog
Publications
Careers
About
Back
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Back
About
Overview
Labs
People
Back
Semiconductors
Back
Artificial Intelligence
Back
Quantum Computing
Back
Hybrid Cloud
Back
Overview
Back
Labs
Back
People
Research
Focus areas
Semiconductors
Artificial Intelligence
Quantum Computing
Hybrid Cloud
Blog
Publications
Careers
About
Overview
Labs
People
Open IBM search field
Close
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
Implementation of Efficient Fft Algorithms on Fused Multiply-Add Architectures
Paper
The multiplicative complexity of discrete cosine transforms
Paper
Modified ffts for fused multiply-add architectures
Paper
On systems of bilinear forms whose minimal division-free algorithms are all bilinear
View all publications