Arithmetic complexity of certain linear transformations

DOI10.1134/S0001434615030256MaRDI QIDQ2352607zbMATH OpenOpenAlexFDO

Authors S. 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

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

Recommendations

• The arithmetic computational complexity of linear transforms
• Arithmetic complexity of the Stirling transforms
• Realization of linear functions by formulas in various bases
• scientific article; zbMATH DE number 609921
• scientific article; zbMATH DE number 6004867

Cites work

• Additive complexity in directed computations
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Cancellation-free circuits in unbounded and bounded depth
• Fast multiplication of polynomials over fields of characteristic 2
• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 609921 (Why is no real title available?)
• scientific article; zbMATH DE number 1144309 (Why is no real title available?)
• scientific article; zbMATH DE number 3795355 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• scientific article; zbMATH DE number 3074072 (Why is no real title available?)
• Linear Circuits over $\operatorname{GF}(2)$
• Modern computer algebra
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• On fast multiplication of polynomials over arbitrary algebras
• On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
• On the complexity of calculation of differentials and gradients

Cited in

(8)

• On complexity of round transformations
• Fast change of basis in algebras
• The arithmetic computational complexity of linear transforms
• scientific article; zbMATH DE number 6004867 (Why is no real title available?)
• Arithmetic complexity of the Stirling transforms
• Calcul de la dynamique de transformations linéaires contractantes mod 1 et arbre de Farey
• On the additive complexity of GCD and LCM matrices
• Lower bounds for additive complexity of linear operators and bilinear algorithms for matrix and polynomial multiplication over GF(2)

This page was built for publication: Arithmetic complexity of certain linear transformations

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