We investigate the computational complexity of some basic problems regarding non-unique probe selection using separable matrices. In particular, we prove that the Minimal d̄-Separable Matrix problem is DP -complete, and the d̄-Separable Submatrix with Reserved Rows problem, which is a generalization of the decision version of the Minimum d̄-Separable Submatrix problem, is Σ2 -complete.
