Application of Approximating Algorithms to Boolean Matrix Multiplication

Authors:
G. Lotti;F. Romani
Affiliations:
lstituto di Scienze dell'lnformazione, Universita di Pisa;-
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 2
Cited 0

Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Boolean matrix multiplication and transitive closure

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)

Quantified Score

Hi-index	14.98

Visualization

Abstract

Bounded integer matrices are matrices whose entries are bounded integers.