On the Exact Complexity of String Matching: Lower Bounds (Q3985805)

From MaRDI portal
Revision as of 12:28, 23 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the Exact Complexity of String Matching: Lower Bounds
scientific article

    Statements

    On the Exact Complexity of String Matching: Lower Bounds (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    string matching
    0 references
    string searching
    0 references
    text editing
    0 references
    worst case behaviour
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references