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

From MaRDI portal
Revision as of 23:37, 4 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the Exact Complexity of String Matching: Lower Bounds
scientific article

    Statements

    title
    On the Exact Complexity of String Matching: Lower Bounds (English)
    0 references
    publication date
    27 June 1992
    0 references
    zbMATH Keywords
    string matching
    0 references
    string searching
    0 references
    text editing
    0 references
    worst case behaviour
    0 references
    author
    Zvi Galil
    0 references
    Raffaele Giancarlo
    0 references

    Identifiers

    DOI
    10.1137/0220063
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68W10
    0 references
    68U15
    0 references
    zbMATH DE Number
    27800
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3985805&oldid=25438958"
    Powered by MediaWiki