We consider the problem of commutative rank computation of a given matrix space, \mathcal{B}\subseteq\mathbb{F}^{n\times n}. The problem is fundamental, as it generalizes several computational problems from algebra and combinatorics. For instance, checking if the commutative rank of the space is n, subsumes problems such as testing perfect matching in graphs ... more >>>