Further processing options
The shortest common supersequence problem over binary alphabet is NP-complete
Saved in:
Journal Title: | Theoretical Computer Science |
---|---|
Authors and Corporations: | , |
In: | Theoretical Computer Science, 16, 1981, 2, p. 187-198 |
Type of Resource: | E-Article |
Language: | English |
published: |
Elsevier BV
|
Subjects: |