The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on the Complexity of the Longest Common Subsequence Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of theorem-proving procedures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing the Number of Evaluation Passes for Attribute Grammars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The String-to-String Correction Problem / rank | |||
Normal rank |
Latest revision as of 13:54, 13 June 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