Improved time and space bounds for Boolean matrix multiplication
From MaRDI portal
Publication:1251068
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)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
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
This page was built for publication: Improved time and space bounds for Boolean matrix multiplication