The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1162163 |
Changed an Item |
||
| Property / author | |||
| Property / author: Kari-Jouko Raeihae / rank | |||
Normal rank | |||
Revision as of 08:53, 22 February 2024
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
