Testing avoidability on sets of partial words is hard (Q1006080)

From MaRDI portal
Revision as of 12:26, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Testing avoidability on sets of partial words is hard
scientific article

    Statements

    title
    Testing avoidability on sets of partial words is hard (English)
    0 references
    author
    Raphaël M. Jungers
    0 references
    Justin Palumbo
    0 references
    publication date
    17 March 2009
    0 references
    zbMATH Keywords
    combinatorics on words
    0 references
    partial words
    0 references
    unavoidable sets
    0 references
    3SAT problem
    0 references
    NP-hard problems
    0 references

    Identifiers

    zbMATH DE Number
    5529524
    0 references
    OpenAlex ID
    W2108981141
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1006080&oldid=38577598"
    Powered by MediaWiki