3 search results - page 1 / 1 » The Computational Complexity of Avoiding Forbidden Submatric... |
IJFCS
2006
13 years 4 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
SOFSEM
2004
Springer
13 years 10 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...