The hardness of counting full words compatible with partial words (Q1936243)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The hardness of counting full words compatible with partial words
scientific article

    Statements

    The hardness of counting full words compatible with partial words (English)
    0 references
    0 references
    0 references
    21 February 2013
    0 references
    partial words
    0 references
    NP-completeness
    0 references
    \(\#\)P complexity class
    0 references
    \(\#\)P-complete problems
    0 references
    combinatorics on words
    0 references

    Identifiers