A note on Boolean matrix multiplication

DOI10.1016/0020-0190(84)90061-9MaRDI QIDQ761038zbMATH OpenOpenAlexFDO

Authors Jozef Vyskoč

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0020-0190(84)90061-9

zbMATH Keywords

interval treeinterval sparsity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An improved algorithm for Boolean matrix multiplication
• A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
• A fast output-sensitive algorithm for Boolean matrix multiplication
• A new algorithm for Boolean matrix multiplication
• scientific article; zbMATH DE number 3917556

Cites work

• scientific article; zbMATH DE number 3340123 (Why is no real title available?)
• Application of Approximating Algorithms to Boolean Matrix Multiplication
• Improved time and space bounds for Boolean matrix multiplication
• The design of dynamic data structures

Cited in

(9)

• A practical algorithm for Boolean matrix multiplication
• scientific article; zbMATH DE number 1405674 (Why is no real title available?)
• An improved algorithm for Boolean matrix multiplication
• Witnesses for Boolean matrix multiplication and for transitive closure
• A new algorithm for Boolean matrix multiplication
• N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm
• scientific article; zbMATH DE number 1979525 (Why is no real title available?)
• scientific article; zbMATH DE number 3917556 (Why is no real title available?)
• scientific article; zbMATH DE number 2239274 (Why is no real title available?)

This page was built for publication: A note on Boolean matrix multiplication

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