Permuting matrices to avoid forbidden submatrices (Q1894366)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Permuting matrices to avoid forbidden submatrices |
scientific article; zbMATH DE number 777827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Permuting matrices to avoid forbidden submatrices |
scientific article; zbMATH DE number 777827 |
Statements
Permuting matrices to avoid forbidden submatrices (English)
0 references
23 April 1996
0 references
The authors survey several known and new results on the algorithmic complexity of the problem of deciding whether the rows and columns of a matrix can be permuted in such a way that the resulting matrix \(M\) avoids all matrices in \({\mathcal F}\), a fixed set of matrices.
0 references
permuting matrices
0 references
forbidden submatrices
0 references
\((0,1)\)-matrices
0 references
algorithmic complexity
0 references
0 references
0 references
0.90333873
0 references
0.9015707
0 references
0 references
0 references
0 references
0 references
0.8794399
0 references
0.8676413
0 references
0.8674951
0 references
