Bit complexity of matrix products

DOI10.1016/0020-0190(91)90065-PzbMath0732.68054OpenAlexW2154761103MaRDI QIDQ808706

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)

Related Items (1)

A new upper bound on the complexity of the all pairs shortest path problem

Cites Work

• How to multiply matrices faster
• Shortest-path problem is not harder than matrix multiplication
• Efficient determination of the transitive closure of a directed graph
• Fast multiplication of large numbers
• A more efficient algorithm for the min-plus multiplication
• Unnamed Item
• Unnamed Item
• Unnamed Item

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