The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The shortest common supersequence problem over binary alphabet is NP- complete |
scientific article; zbMATH DE number 3737027
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The shortest common supersequence problem over binary alphabet is NP- complete |
scientific article; zbMATH DE number 3737027 |
Statements
The shortest common supersequence problem over binary alphabet is NP- complete (English)
0 references
1981
0 references
NP-completeness
0 references
semantic attribute evaluation
0 references
