On the complexity of Boolean matrix ranks

Abstract

We construct a reduction which proves that the fooling set number and the determinantal rank of a Boolean matrix are NP-hard to compute.