On the arithmetic complexity of matrix Kronecker powers

DOI10.1016/0020-0190(83)90054-6zbMath0526.68043OpenAlexW2083518697MaRDI QIDQ594594

Gadiel Seroussi, Fai Ma

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90054-6

zbMATH Keywords

arithmetic complexitymatrix multiplicationKronecker poweralgebraic computational complexity

Mathematics Subject Classification ID

Related Items (1)

Stability, performance and sensitivity analysis of I.I.D. jump linear systems

Cites Work

• Unnamed Item
• Unnamed Item
• On moment behavior of a class of stochastic difference equations
• Limit theorems for non-commutative operators. I
• On the stability of linear and non-linear stochastic transformations
• Rapid Multiplication of Rectangular Matrices
• On the Number of Multiplications Required for Matrix Multiplication

This page was built for publication: On the arithmetic complexity of matrix Kronecker powers