Implementation of the 4 Russians algorithm for boolean matrix multiplication. Boolean matrices are matrices containing only 1s and 0s as entries. Matrix multiplication on boolean matrices A x B can be ...

Sparse Boolean Matrix Multiplication Implementation To speed the calculation up two methods of parallelization have been utilized, both independently and collaboratively. OpenCilk parallelizes the ...

Abstract: This paper presents a new approach to solve Boolean matrix multiplication using a bio-inspired evolutionary method with DNA computing. While there are many papers proposing the use of DNA ...

We study probabilistic extensions of classical deterministic measures of algebraic complexity of a tensor, such as the rank and the border rank. These probabilistic extensions enable improvements over ...

There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.