The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167)

From MaRDI portal
Revision as of 05:40, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The shortest common supersequence problem over binary alphabet is NP- complete
scientific article

    Statements

    title
    The shortest common supersequence problem over binary alphabet is NP- complete (English)
    0 references
    author
    Kari-Jouko Raeihae
    0 references
    Esko Ukkonen
    0 references
    publication date
    1981
    0 references
    zbMATH Keywords
    NP-completeness
    0 references
    semantic attribute evaluation
    0 references

    Identifiers

    zbMATH DE Number
    3737027
    0 references
    Wikidata QID
    Q61067915
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1157167&oldid=13223262"
    Powered by MediaWiki