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

From MaRDI portal
Revision as of 10:48, 20 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
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
    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