The shortest common supersequence problem over binary alphabet is NP-complete
- 1 January 1981
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 16 (2), 187-198
- https://doi.org/10.1016/0304-3975(81)90075-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Minimizing the Number of Evaluation Passes for Attribute GrammarsSIAM Journal on Computing, 1981
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971