Bit complexity of matrix products

DOI10.1016/0020-0190(91)90065-PMaRDI QIDQ808706zbMATH OpenOpenAlexFDO

Authors Andrzej Lingas

Publication date 1991

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

Full work available at URL https://doi.org/10.1016/0020-0190(91)90065-p

zbMATH Keywords

upper boundbit complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• An improved algorithm for Boolean matrix multiplication
• On the complexity of integer matrix multiplication
• How to multiply matrices faster
• The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
• On the Complexity of Matrix Product

Cites work

• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3326575 (Why is no real title available?)
• A more efficient algorithm for the min-plus multiplication
• Efficient determination of the transitive closure of a directed graph
• Fast multiplication of large numbers
• How to multiply matrices faster
• Shortest-path problem is not harder than matrix multiplication

Cited in

(3)

• On the complexity of integer matrix multiplication
• Length Complexity of Tensor Products
• A new upper bound on the complexity of the all pairs shortest path problem

This page was built for publication: Bit complexity of matrix products

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