The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:24, 5 March 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