The Complexity of Pattern Matching for a Random String (Q3854624)

From MaRDI portal
Revision as of 15:28, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of Pattern Matching for a Random String
scientific article

    Statements

    title
    The Complexity of Pattern Matching for a Random String (English)
    0 references
    DOI
    10.1137/0208029
    0 references
    publication date
    1979
    0 references
    zbMATH DE Number
    3655351
    0 references
    zbMATH Keywords
    string matching
    0 references
    average case complexity
    0 references
    OpenAlex ID
    W2071461587
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3854624&oldid=31171675"
    Powered by MediaWiki