Improved Algorithms for Exact and Approximate Boolean Matrix Decomposition

Yuan Sun, Shiwei Ye, Yi Sun +1

An arbitrary $m\times n$ Boolean matrix $M$ can be decomposed {\em exactly} as $M=U\circ V$, where $U$ (resp. $V$) is an $m\times k$ (resp. $k\times n$) Boolean matrix and $\circ$…