A note on the complexity of matching patterns with variables (Q2445237)

From MaRDI portal
Revision as of 00:52, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A note on the complexity of matching patterns with variables
scientific article

    Statements

    A note on the complexity of matching patterns with variables (English)
    0 references
    0 references
    14 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    formal languages
    0 references
    pattern matching with variables
    0 references
    parameterised pattern matching
    0 references
    NP-complete problems
    0 references
    membership problem for pattern languages
    0 references
    0 references