A geometric approach to Boolean matrix multiplication

DOI10.1007/3-540-36136-7_44MaRDI QIDQ4427871zbMATH OpenFDO

Authors Andrzej Lingas

Publication date 14 September 2003

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/2518/25180501.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• A note on Boolean matrix multiplication
• A practical algorithm for Boolean matrix multiplication
• A new algorithm for Boolean matrix multiplication
• An improved algorithm for Boolean matrix multiplication
• Geometry and the complexity of matrix multiplication
• scientific article; zbMATH DE number 89638
• Geometric aspects of iterated matrix multiplication
• A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

Cited in

(8)

• 3D rectangulations and geometric matrix multiplication
• A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
• Regularity lemmas and combinatorial algorithms
• 3D rectangulations and geometric matrix multiplication
• Fast practical algorithms for the Boolean-product-witness-matrix problem
• scientific article; zbMATH DE number 1256679 (Why is no real title available?)
• From-below approximations in Boolean matrix factorization: geometry and new algorithm
• An improved bound on Boolean matrix multiplication for highly clustered data.

This page was built for publication: A geometric approach to Boolean matrix multiplication

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