On the Exact Complexity of String Matching: Upper Bounds (Q4016906)

From MaRDI portal
Revision as of 14:50, 5 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: Upper Bounds
scientific article

    Statements

    title
    On the Exact Complexity of String Matching: Upper Bounds (English)
    0 references
    DOI
    10.1137/0221028
    0 references
    publication date
    16 January 1993
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68U15
    0 references
    68W10
    0 references
    zbMATH DE Number
    89497
    0 references
    zbMATH Keywords
    string searching
    0 references
    text editing
    0 references
    worst case behavior
    0 references
    string matching
    0 references
    author
    Zvi Galil
    0 references
    Raffaele Giancarlo
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4016906&oldid=28258591"
    Powered by MediaWiki