A fast expected time algorithm for Boolean matrix multiplication and transitive closure
- 31 March 1973
- journal article
- Published by Elsevier in Information and Control
- Vol. 22 (2) , 132-138
- https://doi.org/10.1016/s0019-9958(73)90228-3
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Efficient determination of the transitive closure of a directed graphInformation Processing Letters, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969