activity
20182022
most citedLow-Rank Boolean Matrix Approximation by Integer Programming

3 citations · 6 across the 4 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2022

On Minimally Non-Firm Binary Matrices

Reka Agnes Kovacs

For a binary matrix X, the Boolean rank br(X) is the smallest integer k for which X equals the Boolean sum of k rank-1 binary matrices, and the isolation number i(X) is the maximum…