The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms

DOI10.1016/0020-0190(86)90035-9zbMath0584.68059OpenAlexW2097001190WikidataQ54087147 ScholiaQ54087147MaRDI QIDQ1069699

Pan, Victor Y.

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90035-9

zbMATH Keywords

bilinear formslinear formsbilinear algorithmsadditive complexityasynchronous algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

Paraunitary matrices, entropy, algebraic condition number and Fourier computation

Cites Work

• Unnamed Item
• Graph-theoretic properties in computational complexity
• On the multiplicative complexity of the discrete Fourier transform
• On the Asymptotic Complexity of Matrix Multiplication
• Lower Bounds on Synchronous Combinational Complexity
• The additive and logical complexities of linear and bilinear arithmetic algorithms
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

This page was built for publication: The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms