On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708)
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: On the complexity of pattern matching for highly compressed two-dimensional texts. |
scientific article; zbMATH DE number 1910838
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of pattern matching for highly compressed two-dimensional texts. |
scientific article; zbMATH DE number 1910838 |
Statements
On the complexity of pattern matching for highly compressed two-dimensional texts. (English)
0 references
14 May 2003
0 references
