Fast Boolean matrix multiplication for highly clustered data

DOI10.1007/3-540-44634-6_24MaRDI QIDQ4778560zbMATH OpenFDO

Authors Andreas Björklund, Andrzej Lingas

Publication date 18 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2125/21250258

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• An improved bound on Boolean matrix multiplication for highly clustered data.
• On minimum witnesses for Boolean matrix multiplication
• 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

Cited in

(10)

• 3D rectangulations and geometric matrix multiplication
• Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases
• A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
• 3D rectangulations and geometric matrix multiplication
• Fast practical algorithms for the Boolean-product-witness-matrix problem
• A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
• Bulk-synchronous parallel multiplication of Boolean matrices
• On minimum witnesses for Boolean matrix multiplication
• An improved bound on Boolean matrix multiplication for highly clustered data.
• Multiplication of 0-1 matrices via clustering

This page was built for publication: Fast Boolean matrix multiplication for highly clustered data

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