A practical algorithm for Boolean matrix multiplication
type: Item
instance of: scholarly article
title: A practical algorithm for Boolean matrix multiplication
zbMATH Open document ID: 0658.68046
DOI: 10.1016/0020-0190(88)90130-5
author: Michael D. Atkinson
author: N. Santoro
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
review text: An algorithm is given for multiplying two \(n\times n\) Boolean matrices. It has time complexity \(O(n^ 3/(\log n)^{1.5})\) and requires n \(log_ 2 n\) bits of auxiliary storage.
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 4076614
zbMATH Keywords: Boolean matrix multiplication
zbMATH Keywords: time versus storage tradeoffs
MaRDI profile type: Publication
full work available at URL: 0020-0190(88)90130-5
OpenAlex ID: W2035038443
cites work: Improved time and space bounds for Boolean matrix multiplication
cites work: Q4773298
cites work: Q5616735
cites work: Q4745257
cites work: An improved algorithm for Boolean matrix multiplication
cites work: A note on Boolean matrix multiplication
description: scientific article; zbMATH DE number 4076614