The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The shortest common supersequence problem over binary alphabet is NP- complete |
scientific article |
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
