The exact cover problem can be stated as follows. Given a rectangular boolean matrix, delete rows to get a submatrix with exactly one 1 in each column. It is known to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results