On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708)

From MaRDI portal
Revision as of 16:25, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of pattern matching for highly compressed two-dimensional texts.
scientific article

    Statements

    On the complexity of pattern matching for highly compressed two-dimensional texts. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references