A practical algorithm for Boolean matrix multiplication

DOI10.1016/0020-0190(88)90130-5MaRDI QIDQ1111377zbMATH OpenOpenAlexFDO

Authors Michael D. Atkinson, N. Santoro

Publication date 1988

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

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

zbMATH Keywords

Boolean matrix multiplicationtime versus storage tradeoffs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cites work

• scientific article; zbMATH DE number 3800924 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• scientific article; zbMATH DE number 3340123 (Why is no real title available?)
• A note on Boolean matrix multiplication
• An improved algorithm for Boolean matrix multiplication
• Improved time and space bounds for Boolean matrix multiplication

Cited in

(9)

• Fast multiplication of matrices over a finitely generated semiring
• On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems. -- An improved approach
• An efficiently solvable graph partition problem to which many problems are reducible
• N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm
• scientific article; zbMATH DE number 1979525 (Why is no real title available?)
• Design of cellular manufacturing systems based on asymptotic forms of a Boolean matrix
• The Closest Pair Problem under the Hamming Metric
• scientific article; zbMATH DE number 1223727 (Why is no real title available?)
• An efficient algorithm for calculating Boolean difference

This page was built for publication: A practical algorithm for Boolean matrix multiplication

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