Matrix sandwich problems

Research output: Contribution to journalArticlepeer-review


The Π Matrix Sandwich Problem (Π-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 1s such that the completed {0, 1} valued matrix M satisfies property Π? 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 case of matrix completion problems, the latter being generally defined over the real numbers rather than simply {0,1}.

Original languageEnglish
Pages (from-to)239-251
Number of pages13
JournalLinear Algebra and Its Applications
Issue number1-3
StatePublished - 15 Jun 1998
Externally publishedYes


  • Block decomposition of matrices
  • Ferrers diagrams
  • Forbidden submatrix problems
  • Matrix completion problems
  • Matrix sandwich problems

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Matrix sandwich problems'. Together they form a unique fingerprint.

Cite this