The multiplicative complexity of certain semilinear systems defined by polynomials

DOI10.1016/0196-8858(80)90013-5zbMath0528.65006OpenAlexW1968078911MaRDI QIDQ786509

Louis Auslander, Shmuel Winograd

Publication date: 1980

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(80)90013-5

zbMATH Keywords

multiplicative complexityminimal algorithmsemilinear systems defined by polynomialssimple arithmetic operationssteps of arithmetic operations

Mathematics Subject Classification ID

Related Items (3)

The multiplicative complexity of discrete cosine transforms ⋮ The multiplicative complexity of the discrete Fourier transform ⋮ On the direct sum conjecture

Cites Work

• On the multiplicative complexity of the discrete Fourier transform
• Some bilinear forms whose multiplicative complexity depends on the field of constants
• Unnamed Item
• Unnamed Item

This page was built for publication: The multiplicative complexity of certain semilinear systems defined by polynomials