THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS |
scientific article |
Statements
THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (English)
0 references
8 February 2007
0 references
forbidden submatrix
0 references
hitting set
0 references
NP-complete
0 references
polynomial-time constant-factor approximation
0 references
fixed-parameter tractability
0 references
