The arithmetic computational complexity of linear transforms

DOI10.3103/S0027132214060047zbMath1317.65270OpenAlexW2042128628MaRDI QIDQ2356497

Sergey B. Gashkov

Publication date: 30 July 2015

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132214060047

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Cites Work

• On fast multiplication of polynomials over arbitrary algebras
• Fast multiplication of polynomials over fields of characteristic 2
• Linear Circuits over $\operatorname{GF}(2)$
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The arithmetic computational complexity of linear transforms