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

From MaRDI portal
Revision as of 00:32, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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