A practical algorithm for Boolean matrix multiplication

DOI10.1016/0020-0190(88)90130-5zbMath0658.68046OpenAlexW2035038443MaRDI QIDQ1111377

Michael D. Atkinson, Nicola 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)

Related Items (6)

An efficiently solvable graph partition problem to which many problems are reducible ⋮ N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm ⋮ The Closest Pair Problem under the Hamming Metric ⋮ Fast multiplication of matrices over a finitely generated semiring ⋮ Design of cellular manufacturing systems based on asymptotic forms of a Boolean matrix ⋮ On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems. -- An improved approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Boolean matrix multiplication
• An improved algorithm for Boolean matrix multiplication
• Improved time and space bounds for Boolean matrix multiplication

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