Matrix multiplication for finite algebraic systems

DOI10.1016/0020-0190(88)90207-4zbMath0738.65041OpenAlexW2087139243MaRDI QIDQ1813190

Harry B. III Hunt, Daniel J. Rosenkrantz

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90207-4

zbMATH Keywords

discrete mathematicsanalysis of algorithmsmatrix multiplicationsequential computationfinite algebraic systemsmatrix closureSIMD parallel computation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Fast multiplication of matrices over a finitely generated semiring

Cites Work

• How to multiply matrices faster
• Unnamed Item

This page was built for publication: Matrix multiplication for finite algebraic systems