On the fraction of matrices with maximal additive complexity

DOI10.1515/DMA-2014-0031zbMATH Open1403.15023OpenAlexW2335746441MaRDI QIDQ2629752FDOQ2629752

Authors: F. M. Malyshev 

Publication date: 7 July 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2014-0031

Recommendations

• Semi-algebraic complexity -- Additive complexity of matrix computational tasks
• On the additive complexity of GCD and LCM matrices
• On the additive complexity of 2 \(\times 2\) matrix multiplication
• On the Gröbner complexity of matrices
• scientific article; zbMATH DE number 2104735
• On the complexity of approximating extremal determinants in matrices
• On obtaining upper bounds on the complexity of matrix multiplication
• On the complexity of some algorithms of matrix multiplication
• Complexity of matrix problems
• scientific article; zbMATH DE number 151736

zbMATH Keywords

additive complexitycomplexity of a matrixMDS-matrices

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Cited In (3)

• Lower bounds on the graver complexity of \(M\)-fold matrices
• Prism complexity of matrices
• Многомерный линейный метод и показатели рассеивания линейной среды шифрпреобразований

This page was built for publication: On the fraction of matrices with maximal additive complexity

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