A note on Boolean matrix multiplication

DOI10.1016/0020-0190(84)90061-9zbMath0556.68010OpenAlexW2015883174MaRDI QIDQ761038

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)

Related Items (3)

N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm ⋮ A practical algorithm for Boolean matrix multiplication ⋮ An improved algorithm for Boolean matrix multiplication

Cites Work

• Unnamed Item
• The design of dynamic data structures
• Improved time and space bounds for Boolean matrix multiplication
• Application of Approximating Algorithms to Boolean Matrix Multiplication

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