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 ...

Boolean Matrix Multiplication, using a custom blocked data structure similar to the CSR/CSC, is implemented for three different parallel configurations: 1) OpenMP, 2) OpenMPI and 3) OpenMP/OpenMPI.

Abstract: Boolean matrix multiplication (BMM) is a fundamental problem with applications in graph theory, group testing, data compression, and digital signal processing (DSP). The search for efficient ...