An improved algorithm for Boolean matrix multiplication-Reference-Cited by-同舟云学术

An improved algorithm for Boolean matrix multiplication

Published:1986-12 Issue:4 Volume:36 Page:375-382
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Santoro N.,Urrutia J.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02240211.pdf

Reference3 articles.

1. Arlazarof, V. L., Dinic, E. A., Kronrod, M. A., Faradzev, I. A.: On economical construction of the transitive closure of a directed graph. Doki. Akad. Nauk SSR194, 487–488 (1970).

2. Santoro, N.: FourO(N 2) multiplication methods for sparse and dense Boolean matrices. In: Proc. 10th Conf. Numerical Mathematics and Computing, pp. 241–253. Winnipeg, Manitoba, 1980.

3. Vyskoč, J.: A note on Boolean matrix multiplication. Inf. Proc. Letters19, 249–251 (1984).

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14

2. The Mailman algorithm: A note on matrix–vector multiplication;Information Processing Letters;2009-01

3. Introduction: How to Use this Book;Algebraic Cryptanalysis;2009

4. On the use of the asymptotic forms of the boolean matrix for designing cellular manufacturing systems — An improved approach;European Journal of Operational Research;1997-08

5. Design of cellular manufacturing systems based on asymptotic forms of a boolean matrix;European Journal of Operational Research;1993-06