Improved time and space bounds for Boolean matrix multiplication

Acta Informatica ◽

10.1007/bf00264600 ◽

1978 ◽

Vol 11 (1) ◽

Author(s):

Leonard Adleman ◽

KelloggS. Booth ◽

FrancoP. Preparata ◽

WalterL. Ruzzo

Keyword(s):

Matrix Multiplication ◽

Boolean Matrix ◽

Time And Space ◽

Boolean Matrix Multiplication

Download Full-text

Boolean matrix multiplication using only O(n log 2 7 log n) bit operations

ACM SIGACT News ◽

10.1145/1008361.1008362 ◽

1977 ◽

Vol 9 (3) ◽

pp. 23-23 ◽

Author(s):

Kellogg S. Booth

Keyword(s):

Matrix Multiplication ◽

Boolean Matrix ◽

Boolean Matrix Multiplication

Download Full-text

A fast expected time algorithm for Boolean matrix multiplication and transitive closure

Information and Control ◽

10.1016/s0019-9958(73)90228-3 ◽

1973 ◽

Vol 22 (2) ◽

pp. 132-138 ◽

Author(s):

Patrick E. O'Neil ◽

Elizabeth J. O'Neil

Keyword(s):

Transitive Closure ◽

Matrix Multiplication ◽

Time Algorithm ◽

Boolean Matrix ◽

Expected Time ◽

Boolean Matrix Multiplication

Download Full-text

Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision

Algorithmica ◽

10.1007/s00453-015-9985-x ◽

2015 ◽

Vol 76 (1) ◽

pp. 1-16 ◽

Author(s):

Stacey Jeffery ◽

Robin Kothari ◽

François Le Gall ◽

Frédéric Magniez

Keyword(s):

Matrix Multiplication ◽

Boolean Matrix ◽

Query Complexity ◽

Quantum Query Complexity ◽

Boolean Matrix Multiplication ◽

Download Full-text

Fast context-free parsing requires fast Boolean matrix multiplication

10.3115/976909.979619 ◽

1997 ◽

Author(s):

Lillian Lee

Keyword(s):

Matrix Multiplication ◽

Boolean Matrix ◽

Boolean Matrix Multiplication ◽

Download Full-text

A new approach for Boolean matrix multiplication with DNA computing

2008 IEEE Conference on Soft Computing in Industrial Applications ◽

10.1109/smcia.2008.5045933 ◽

2008 ◽

Author(s):

Nordiana Rajaee ◽

H. Aoyagi ◽

K. Yabe ◽

Y. Kon ◽

Osamu Ono

Keyword(s):

Dna Computing ◽

Matrix Multiplication ◽

Boolean Matrix ◽

New Approach ◽

Boolean Matrix Multiplication

Download Full-text

Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions

Algorithmica ◽

10.1007/s004539900059 ◽

1996 ◽

Vol 16 (4-5) ◽

pp. 434-449 ◽

Author(s):

N. Alon, M. Naor

Keyword(s):

Matrix Multiplication ◽

Hash Functions ◽

Boolean Matrix ◽

Boolean Matrix Multiplication

Download Full-text

Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions

Algorithmica ◽

10.1007/bf01940874 ◽

1996 ◽

Vol 16 (4-5) ◽

pp. 434-449 ◽

Author(s):

N. Alon ◽

M. Naor

Keyword(s):

Matrix Multiplication ◽

Hash Functions ◽

Boolean Matrix ◽

Boolean Matrix Multiplication

Download Full-text

Witnesses for Boolean Matrix Multiplication and for Transitive Closure

Journal of Complexity ◽

10.1006/jcom.1993.1014 ◽

1993 ◽

Vol 9 (2) ◽

pp. 201-221 ◽

Author(s):

Zvi Galil ◽

Olded Margalit

Keyword(s):

Transitive Closure ◽

Matrix Multiplication ◽

Boolean Matrix ◽

Boolean Matrix Multiplication

Download Full-text

Quantum Complexity of Boolean Matrix Multiplication and Related Problems

Computing with New Resources - Lecture Notes in Computer Science ◽

10.1007/978-3-319-13350-8_13 ◽

2014 ◽

pp. 176-191

Author(s):

François Le Gall

Keyword(s):

Matrix Multiplication ◽

Boolean Matrix ◽

Boolean Matrix Multiplication ◽

Quantum Complexity

Download Full-text

Fast context-free grammar parsing requires fast boolean matrix multiplication

Journal of the ACM ◽

10.1145/505241.505242 ◽

2002 ◽

Vol 49 (1) ◽

pp. 1-15 ◽

Author(s):

Lillian Lee

Keyword(s):

Matrix Multiplication ◽

Boolean Matrix ◽

Context Free Grammar ◽

Boolean Matrix Multiplication ◽

Download Full-text