Bulk-synchronous parallel multiplication of Boolean matrices

DOI10.1007/BFB0055078MaRDI QIDQ4219043zbMATH OpenFDO

Authors Alexander Tiskin

Publication date 15 November 1998

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

Full work available at URL https://doi.org/10.1007/BFB0055078

zbMATH Keywords

Boolean matrix multiplicationbulk-synchronous parallel computationcomplexityStrassen-type algorithmsubcubic algorithmsSzemerédi's regularity lemma

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Erratum: Bulk-synchronous parallel multiplication of Boolean matrices
• A fast output-sensitive algorithm for Boolean matrix multiplication
• A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
• A practical algorithm for Boolean matrix multiplication
• Fast parallel algorithms for binary multiplication and their implementation on systolic architectures
• A new algorithm for Boolean matrix multiplication
• Parallel complexity of matrix multiplication
• Parallel algorithms and architectures for matrix multiplication
• Bulk-synchronous parallel Gaussian elimination
• Fast Boolean matrix multiplication for highly clustered data

Cited in

(4)

• Memory-efficient matrix multiplication in the BSP model
• Axiomatization and characterization of BSP algorithms
• scientific article; zbMATH DE number 589878 (Why is no real title available?)
• Erratum: Bulk-synchronous parallel multiplication of Boolean matrices

This page was built for publication: Bulk-synchronous parallel multiplication of Boolean matrices

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