Improved time and space bounds for Boolean matrix multiplication

DOI10.1007/BF00264600zbMath0389.68016MaRDI QIDQ1251068

Kellogg S. Booth, Walter L. Ruzzo, Franco P. Preparata, Leonard M. Adleman

Publication date: 1978

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Matrix equations and identities (15A24)

Related Items

An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs, A practical algorithm for Boolean matrix multiplication, Parsing by matrix multiplication generalized to Boolean grammars, A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph, A note on Boolean matrix multiplication