DeepAI AI Chat
Log In Sign Up

Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication

by   Debarati Das, et al.
Charles University in Prague

In this paper we propose models of combinatorial algorithms for the Boolean Matrix Multiplication (BMM), and prove lower bounds on computing BMM in these models. First, we give a relatively relaxed combinatorial model which is an extension of the model by Angluin (1976), and we prove that the time required by any algorithm for the BMM is at least Ω(n^3 / 2^O( √( n ))). Subsequently, we propose a more general model capable of simulating the "Four Russians Algorithm". We prove a lower bound of Ω(n^7/3 / 2^O(√( n ))) for the BMM under this model. We use a special class of graphs, called (r,t)-graphs, originally discovered by Rusza and Szemeredi (1978), along with randomization, to construct matrices that are hard instances for our combinatorial models.


page 1

page 2

page 3

page 4


The I/O complexity of hybrid algorithms for square matrix multiplication

Asymptotically tight lower bounds are derived for the I/O complexity of ...

Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds

Communication lower bounds have long been established for matrix multipl...

Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv

The main theme of this paper is using k-dimensional generalizations of t...

New lower bounds for matrix multiplication and the 3x3 determinant

Let M_〈 u,v,w〉∈ C^uv⊗ C^vw⊗ C^wu denote the matrix multiplication tensor...

Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication

An elastic-degenerate (ED) string is a sequence of n sets of strings of ...

Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles

Cohn and Umans proposed a framework for developing fast matrix multiplic...

Subcubic Certificates for CFL Reachability

Many problems in interprocedural program analysis can be modeled as the ...