Arithmetic complexity of certain linear transformations

DOI10.1134/S0001434615030256zbMath1331.68106OpenAlexW2160532151MaRDI QIDQ2352607

Sergey B. Gashkov

Publication date: 3 July 2015

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434615030256

zbMATH Keywords

arithmetic computational complexity of linear transformationsfield of characteristic \(p\)finite arithmetic basislinear transformation (binomial, Stirling, Lah, Gauss, Serpiński, Sylvester)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear transformations, semilinear transformations (15A04)

Related Items

On the additive complexity of GCD and LCM matrices

Cites Work

• Additive complexity in directed computations
• On fast multiplication of polynomials over arbitrary algebras
• Fast multiplication of polynomials over fields of characteristic 2
• Cancellation-free circuits in unbounded and bounded depth
• Linear Circuits over $\operatorname{GF}(2)$
• On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• On the complexity of calculation of differentials and gradients
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item