On Claw-Free Asteroidal Triple-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
The power of negative thinking in multiplying Boolean matrices
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A time-space tradeoff for sorting on a general sequential model of computation
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Application of Approximating Algorithms to Boolean Matrix Multiplication
IEEE Transactions on Computers
Establishing lower bounds on algorithms: a survey
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Modular code generation from synchronous block diagrams: modularity vs. code size
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An efficient context-free parsing algorithm for natural languages
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Comparing apples and oranges through partial orders: an empirical approach
ACC'09 Proceedings of the 2009 conference on American Control Conference
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
Algorithms and theory of computation handbook
Finding strong bridges and strong articulation points in linear time
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Subquadratic time approximation algorithms for the girth
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Finding strong bridges and strong articulation points in linear time
Theoretical Computer Science
| Hi-index | 0.00 |
Arithmetic operations on matrices are applied to the problem of finding the transitive closure of a Boolean matrix. The best transitive closure algorithm known, due to Munro, is based on the matrix multiplication method of Strassen. We show that his method requires at most O(nα ċ P(n)) bitwise operations, where α = log27 and P(n) bounds the number of bitwise operations needed for arithmetic modulo n+1. The problems of computing the transitive closure and of computing the "and-or" product of Boolean matrices are shown to be of the same order of difficulty. A transitive closure method based on matrix inverse is presented which can be used to derive Munro's method.