1 paper
Rasmus Resen Amossen, Andrea Campagna, Rasmus Pagh
We consider the problem of doing fast and reliable estimation of the number of non-zero entries in a sparse boolean matrix product. This problem has applications in databases and c…