A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
From MaRDI portal
Recommendations
Cited in
(17)- An improved algorithm for Boolean matrix multiplication
- scientific article; zbMATH DE number 4133979 (Why is no real title available?)
- Fast Output-Sensitive Matrix Multiplication
- Fast practical algorithms for the Boolean-product-witness-matrix problem
- scientific article; zbMATH DE number 1223727 (Why is no real title available?)
- scientific article; zbMATH DE number 1979525 (Why is no real title available?)
- scientific article; zbMATH DE number 1830739 (Why is no real title available?)
- scientific article; zbMATH DE number 1405674 (Why is no real title available?)
- On nondeterministic derandomization of Freivalds' algorithm: consequences, avenues and algorithmic progress
- Probabilistic tensors and opportunistic Boolean matrix multiplication
- A new algorithm for Boolean matrix multiplication
- Speeding up the four Russians algorithm by about one more logarithmic factor
- A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
- An improved bound on Boolean matrix multiplication for highly clustered data.
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Improving compressed matrix multiplication using control variate method
- A note on Boolean matrix multiplication
This page was built for publication: A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3639263)