The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61067915, #quickstatements; #temporary_batch_1705824220644 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:40, 31 January 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
