The multiplicative complexity of certain semilinear systems defined by polynomials

DOI10.1016/0196-8858(80)90013-5zbMATH Open0528.65006OpenAlexW1968078911MaRDI QIDQ786509FDOQ786509

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

Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Algorithms for approximation of functions (65D15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some bilinear forms whose multiplicative complexity depends on the field of constants
• On the multiplicative complexity of the discrete Fourier transform

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786509)