An improved algorithm for Boolean matrix multiplication
From MaRDI portal
Recommendations
- A new algorithm for Boolean matrix multiplication
- Speeding up the four Russians algorithm by about one more logarithmic factor
- A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Fast practical algorithms for the Boolean-product-witness-matrix problem
Cites work
Cited in
(15)- A fast output-sensitive algorithm for Boolean matrix multiplication
- Design of cellular manufacturing systems based on asymptotic forms of a Boolean matrix
- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
- scientific article; zbMATH DE number 3917556 (Why is no real title available?)
- The Mailman algorithm: a note on matrix-vector multiplication
- A new algorithm for Boolean matrix multiplication
- An efficient algorithm for calculating Boolean difference
- A note on Boolean matrix multiplication
- A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
- Speeding up the four Russians algorithm by about one more logarithmic factor
- On minimum witnesses for Boolean matrix multiplication
- Lower bounds for combinatorial algorithms for Boolean matrix multiplication
- scientific article; zbMATH DE number 1979525 (Why is no real title available?)
- A practical algorithm for Boolean matrix multiplication
- On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems. -- An improved approach
This page was built for publication: An improved algorithm for Boolean matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068514)