Matrix sandwich problems

Martin Charles Golumbic
1998 Linear Algebra and its Applications  
The /7 Matrix Sandwich Problem (H-MSP) is introduced here as follows: Given a {0, 1"} valued matrix A, where • is interpreted as "do not care", does there exist a fill-in of the asterisks • with 0s and ls such that the completed {0, 1} valued matrix M satisfies property/7? We study the computational complexity of this problem for several matrix properties including the Ferrers property, block decompositions and certain forbidden submatrices. Matrix sandwich problems are an important special
more » ... of matrix completion problems, the latter being generally defined over the real numbers rather than simply {0,1}.
doi:10.1016/s0024-3795(97)10075-1 fatcat:7xmw4p3vozg6thnm47wfpltzd4