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

From MaRDI portal
Revision as of 12:46, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references